92 search results - page 1 / 19 » Probabilistic Proof Systems - A Survey |
STACS
1997
Springer
13 years 9 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...
AC
2000
Springer
13 years 4 months ago
2000
Springer
Abstract. In the late 80's Blum, Luby, Rubinfeld, Kannan et al. pioneered the theory of self
BIRTHDAY
2006
Springer
13 years 8 months ago
2006
Springer
FSTTCS
2010
Springer
13 years 2 months ago
2010
Springer
This paper describes a project that aims at showing that propositional proofs of certain tautologies in weak proof system give upper bounds on the computational complexity of func...
STACS
2001
Springer
13 years 9 months ago
2001
Springer
Most known constructions of probabilistically checkable proofs (PCPs) either blow up the proof size by a large polynomial, or have a high (though constant) query complexity. In thi...