19 search results - page 3 / 4 » A Proof Theoretic Analysis of Intruder Theories |
FOCS
2002
IEEE
13 years 11 months ago
2002
IEEE
We obtain a near-tight bound of O(n3+ε ), for any ε > 0, on the complexity of the overlay of the minimization diagrams of two collections of surfaces in four dimensions. This...
IACR
2011
12 years 5 months ago
2011
We analyze the multivariate generalization of Howgrave-Graham’s algorithm for the approximate common divisor problem. In the m-variable case with modulus N and approximate common...
FOCS
2007
IEEE
14 years 9 days ago
2007
IEEE
In this paper, we resolve the smoothed and approximative complexity of low-rank quasi-concave minimization, providing both upper and lower bounds. As an upper bound, we provide th...
COMPGEOM
2011
ACM
12 years 9 months ago
2011
ACM
We present a clustering scheme that combines a mode-seeking phase with a cluster merging phase in the corresponding density map. While mode detection is done by a standard graph-b...
TOPLAS
2008
13 years 5 months ago
2008
lem of inferring termination from such abstract information is not the halting problem for programs and may well be decidable. If this is the case, the decision algorithm forms a &...