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

1058 The knowledge complexity of interactive proof systems – Shafi Goldwasser, Silvio Micali, Charles Rackoff - 1985
2359 Monotone Complexity – Michelangelo Grigni , Michael Sipser - 1990
785 The complexity of theorem-proving procedures – Stephen A. Cook - 1971
1481 Theory of Linear and Integer Programming – A Schrijver - 1998
3890 J.D.: Introduction to Automata Theory, Languages and Computation, 2nd edn – J E Hopcroft, R Motwani, Ullman - 2001
1989 The theory of error-correcting codes – F J MacWilliams, N J A Sloane - 1977
8668 Introduction to Algorithms – T H Cormen, C E Leiserson, R L Rivest, C Stein - 2001
261 Checking Computations in Polylogarithmic Time – László Babai, Lance Fortnow, Leonid A. Levin, Mario Szegedy - 1991
407 Non-Deterministic Exponential Time has Two-Prover Interactive Protocols – Laszlo Babai, Lance Fortnow, Carsten Lund