4850 search results - page 194 / 970 » Proof and Computation in Geometry |
153
click to vote
DGCI
2008
Springer
15 years 8 months ago
2008
Springer
In this paper we prove that the function giving the frequency of a class of patterns of digital planes with respect to the slopes of the plane is continuous and piecewise affine, m...
191
click to vote
STOC
2006
ACM
16 years 6 months ago
2006
ACM
It is proved that several interactive proof systems are zero-knowledge against general quantum attacks. This includes the Goldreich?Micali?Wigderson classical zero-knowledge proto...
159
click to vote
FOCS
2002
IEEE
15 years 11 months ago
2002
IEEE
We prove a quasi-polynomial lower bound on the size of bounded-depth Frege proofs of the pigeonhole principle PHPm n where m ´1 · 1 polylog nµn. This lower bound qualitatively ...
140
click to vote
BIRTHDAY
2010
Springer
15 years 6 months ago
2010
Springer
Abstract. We present a succinct account of dynamic rippling, a technique used to guide the automation of inductive proofs. This simplifies termination proofs for rippling and hence...
157
click to vote
WMCSA
2009
IEEE
16 years 1 months ago
2009
IEEE
Location is rapidly becoming the next “killer application” as location-enabled mobile handheld devices proliferate. One class of applications that has yet-to-emerge are those ...