STACS
1997
Springer
13 years 8 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...
STOC
2009
ACM
14 years 5 months ago
2009
ACM
In this paper we study a fundamental open problem in the area of probabilistic checkable proofs: What is the smallest s such that NP naPCP1,s[O(log n), 3]? In the language of har...