Designing Programs That Check Their Work (1989)

Cached

Download Links

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

Active Bibliography

101 Software Reliability via Run-Time Result-Checking – Manuel Blum, Hal Wasserman - 1994
13 The Power of Adaptiveness and Additional Queries in Random-Self-Reductions – Joan Feigenbaum, Lance Fortnow, Carsten Lund, Daniel Spielman - 1994
68 Efficient Checking of Polynomials and Proofs and the Hardness of Approximation Problems – Madhu Sudan - 1992
The Weizmann Workshop on Probabilistic Proof Systems – Uriel Feige, Shafi Goldwasser (Eds.), Shafi Goldwasser - 1994
718 Proof verification and hardness of approximation problems – Sanjeev Arora, Carsten Lund, Rajeev Motwani, Madhu Sudan, Mario Szegedy - 1992
1 An Information-Theoretic Treatment of Random-Self-Reducibility – Joan Feigenbaum, Martin Strauss - 1997
The Computational Complexity Column – Lance Fortnow Nec, Lance Fortnow, Lance Fortnow, Steve Homer
46 Arithmetization: A New Method In Structural Complexity Theory – László Babai, Lance Fortnow - 1991
The Complexity of Equivalence Relations – Joshua A. Grochow - 2008
On the Computational Power of Locally Random Reductions ∗ – Rahul Tripathi - 2010
Efficient Checking of Polynomials and Proofs – Madhu Sudan, Madhu Sudan
22 Locally Random Reductions in Interactive Complexity Theory – Joan Feigenbaum - 1993
On the Random-Self-Reducibility . . . – Joan Feigenbaum, Lance Fortnow - 1993
10 The Power Of Interaction – Carsten Lund - 1991
17 Transparent Proofs and Limits to Approximation – László Babai - 1994
7 Robust PCPs of proximity and shorter PCPs – Prahladh Harsha - 2004
41 On Monotone Formula Closure of SZK – Alfredo De Santis, Giovanni Di Crescenzo, Giuseppe Persiano, Moti Yung - 1994
5 Probabilistic Proof Systems -- A Survey – Oded Goldreich - 1996
15 A Taxonomy of Proof Systems – Oded Goldreich - 1997