Probabilistic Proof Systems -- A Survey (1996)

by Oded Goldreich
Venue:IN SYMPOSIUM ON THEORETICAL ASPECTS OF COMPUTER SCIENCE
Citations:5 - 0 self

Documents Related by Co-Citation

1039 The knowledge complexity of interactive proof systems – Shafi Goldwasser, Silvio Micali, Charles Rackoff - 1985
261 Checking Computations in Polylogarithmic Time – László Babai, Lance Fortnow, Leonid A. Levin, Mario Szegedy - 1991
12 Free bits and non-approximability – M Bellare, O Goldreich, M Sudan - 1995
3 Linearity testing in chacaracteristic two – M Bellare, D Coppersmith, J Hastad, M Kiwi, M Sudan - 1995
3 The noisy oracle model – U Feige, A Shamir, M Tennenholtz - 1987
2 some of this material is – L Babai, S Moran - 1988
2 Random debaters and the hardness of approximting stochastic functions – A Condon, J Feigenbaum, C Lund, P Shor - 1994
2 Approximating clique is almost NP-complete – Manuscript F Ergun, S Ravikumar, D Sivakumar Manuscript - 1995
2 Combinatorial problems of elementary group theory – C Lund - 1994
2 Sip96] M. Sipser. Introduction to the theory of computation – Manuscript - 1991
3 Universal’nyĭe perebornyĭe zadachi – L Levin - 1973
6 Orthogonal Polynomials, volume 23 of Colloquium Publications – G Szegö - 1939
14 Introduction to coding theory, volume 86 of Graduate Texts in Mathematics – J H van Lint - 1991
27 Computational Models of Games – A Condon - 1989
19 Robust Characterizations of Polynomials and Their Applications to Program Testing – R Rubinfeld, M Sudan - 1996
17 Transparent Proofs and Limits to Approximation – László Babai - 1994
27 Program result-checking: A theory of testing meets a test of theory – Manuel Blum, Hal Wasserman - 1994
32 Probabilistically Checkable Debate Systems and Nonapproximability of PSPACE-Hard Functions – Anne Condon, Joan Feigenbaum, Carsten Lund, Peter Shor - 1993
28 Leeuwen (editor), Handbook of theoretical computer science, volume – Jan van - 1990