|
|
Alternation in Interaction
– n.n.
|
|
605
|
Proof verification and hardness of approximation problems
– Sanjeev Arora, Carsten Lund, Rajeev Motwani, Madhu Sudan, Mario Szegedy
- 1992
|
|
16
|
Transparent Proofs and Limits to Approximation
– László Babai
- 1994
|
|
14
|
A Taxonomy of Proof Systems
– Oded Goldreich
- 1997
|
|
|
The Weizmann Workshop on Probabilistic Proof Systems
– Uriel Feige, Shafi Goldwasser (Eds.), Shafi Goldwasser
- 1994
|
|
191
|
Free Bits, PCPs and Non-Approximability -- Towards Tight Results
– Mihir Bellare, Oded Goldreich, Madhu Sudan
- 1996
|
|
11
|
The approximability of NP-hard problems
– Sanjeev Arora
- 1998
|
|
6
|
A Short History of Computational Complexity
– Lance Fortnow, Steve Homer
- 2002
|
|
|
The Computational Complexity Column
– Lance Fortnow Nec, Lance Fortnow, Lance Fortnow, Steve Homer
|
|
7
|
Robust PCPs of proximity and shorter PCPs
– Prahladh Harsha
- 2004
|
|
2
|
On the Role of Algebra in the Efficient Verification of Proofs
– Madhu Sudan
- 1994
|
|
1
|
Runtime Verification of Remotely Executed Code using Probabilistically Checkable Proof Systems
– Tugkan Batu, Ronitt Rubinfeld, Patrick White
|
|
319
|
Probabilistic checking of proofs: a new characterization of NP
– Sanjeev Arora
- 1998
|
|
10
|
The Power Of Interaction
– Carsten Lund
- 1991
|
|
561
|
Some optimal inapproximability results
– Johan Håstad
- 2002
|
|
11
|
A Combinatorial Consistency Lemma with application to proving the PCP Theorem
– Oded Goldreich, Shmuel Safra
- 1997
|
|
|
Probabilistic Proof Systems: A Primer
– Oded Goldreich
- 2008
|
|
87
|
Hardness Of Approximations
– Sanjeev Arora , Carsten Lund
- 1996
|
|
2
|
Fast approximate PCPs
– Funda Ergün, Ravi Kumar, Ronitt Rubinfeld
- 1999
|
