48 search results - page 1 / 10 » Probabilistically Checkable Proofs and Applications |
GI
1995
Springer
14 years 2 months ago
1995
Springer
STACS
1997
Springer
14 years 3 months 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...
ISTCS
1995
Springer
14 years 2 months ago
1995
Springer
A low-degree test is a collection of simple, local rules for checking the proximity of an arbitrary function to a lowdegree polynomial. Each rule depends on the function’s value...
33
Voted
SIAMCOMP
2008
13 years 11 months ago
2008
We give constructions of probabilistically checkable proofs (PCPs) of length n
ECCC
2007
13 years 11 months ago
2007
