338 search results - page 2 / 68 » Locally checkable proofs |
STACS
1997
Springer
14 years 12 hour ago
1997
Springer
Various types of probabilistic proof systems have played a central role in the development of computer science in the last decade. In this exposition, we concentrate on three such...
ECCC
2011
12 years 11 months ago
2011
The last two decades have seen enormous progress in the development of sublinear-time algorithms — i.e., algorithms that examine/reveal properties of “data” in less time tha...
SIAMCOMP
2008
13 years 7 months ago
2008
We give constructions of probabilistically checkable proofs (PCPs) of length n
CAV
2004
Springer
13 years 11 months ago
2004
Springer
Model checking algorithms can report a property as being true for reasons that may be considered vacuous. Current algorithms for detecting vacuity require either checking a quadrat...
GI
1995
Springer
13 years 11 months ago
1995
Springer
