3552 search results - page 271 / 711 » Proof theory in the abstract |
171
click to vote
COMPGEOM
2004
ACM
16 years 2 days ago
2004
ACM
Let P be a set of n points in general position in the plane. Let Xk(P ) denote the number of empty convex k-gons determined by P. We derive, using elementary proof techniques, sev...
155
click to vote
COMPGEOM
2003
ACM
15 years 12 months ago
2003
ACM
Pointed pseudo-triangulations are planar minimally rigid graphs embedded in the plane with pointed vertices (adjacent to an angle larger than π). In this paper we prove that the ...
170
click to vote
FOCS
2002
IEEE
15 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...
164
click to vote
FOCS
1994
IEEE
15 years 10 months ago
1994
IEEE
We establish a nonlinear lower bound for halfplane range searching over a group. Specifically, we show that summing up the weights of n (weighted) points within n halfplanes requir...
209
click to vote
ESOP
2006
Springer
15 years 10 months ago
2006
Springer
We present a sound and complete proof technique, based on syntactic logical relations, for showing contextual equivalence of expressions in a -calculus with recursive types and imp...