Designing Programs That Check Their Work (1989)

Cached

Download Links

by Manuel Blum , Sampath Kannan
Citations:305 - 17 self

Documents Related by Co-Citation

406 Non-Deterministic Exponential Time has Two-Prover Interactive Protocols – Laszlo Babai, Lance Fortnow, Carsten Lund
309 Algebraic Methods for Interactive Proof Systems – Carsten Lund, Lance Fortnow, Howard Karloff, Noam Nisan - 1990
131 On the Power of Multi-Prover Interactive Protocols – Lance Fortnow, John Rompel, Michael Sipser - 1988
305 Trading Group Theory for Randomness – László Babai - 1985
132 Multi-Prover interactive proofs: How to remove intractability assumptions – Michael Ben-or, Shafi Goldwassert, Avi Wigdemons - 1988
348 Self-Testing/Correcting with Applications to Numerical Problems – Manuel Blum, Michael Luby, Ronitt Rubinfeld - 1990
160 Hiding instances in multioracle queries – Donald Beaver, J Feigenbaum - 1990
260 Checking Computations in Polylogarithmic Time – László Babai, Lance Fortnow, Leonid A. Levin, Mario Szegedy - 1991
20 R.: Selftesting and Self-correcting programs, with Applications to Numerical Programs – M Blum, M Luby, Rubinfeld - 1990
311 Arthur-merlin Games: A Randomized Proof System, and a Hierarchy of Complexity classes – L Babai - 1988
1051 The knowledge complexity of interactive proof systems – Shafi Goldwasser, Silvio Micali, Charles Rackoff - 1985
109 New directions in testing – Richard Lipton - 1989
45 Arithmetization: A New Method In Structural Complexity Theory – László Babai, Lance Fortnow - 1991
37 Are There Interactive Protocols for Co-NP Languages? – Lance Fortnow, Michael Sipser - 1988
94 Two-prover one-round proof systems: their power and their problems (Extended Abstract) – Uriel Feige , Laszlo Lovasz - 1992
572 Optimization, approximation, and complexity classes – C H Papadimitriou, M Yannakakis - 1991
366 Probabilistic checking of proofs: a new characterization of NP – Sanjeev Arora - 1998
185 Approximating clique is almost NPcomplete – U Feige, S Goldwasser, L Lovász, S Safra, M Szegedy - 1991
88 The Knowledge Complexity of Interactive Proof – S Goldwasser, S Micali, C Racko - 1989