M. Sudan, V. Guruswami  Home/Search
Context Related
| 18.52.0.92/~madhu/pcp/pcp.ps Cached: PS.gz PS PDF This document uses CoBlitz to cache paper downloads. If your firewall is blocking outgoing connections to port 3125, you can use these links to download local copies.
Image Update HelpPS.gz PS PDF From: 18.52.0.92/~madhu/pcp/course (more) (Enter author homepages) |
Rate this article:      (best)Comment on this article |
Abstract: INTRODUCTION TO PCPs 1. Overview The goal of this four part lecture series is to present (the important ideas and most details of) the proof of the following striking assertion: There is a format of writing proofs and a probabilistic method of verifying their validity, such that the verifier needs to reads only 3 bits of the proof (irrespective of the length of the proof) to obtain probabilistic confidence in the correctness of the proof. Specifically, the verifier accepts correct proofs with... (Update)
Context of citations to this paper: More
...fact in this survey, but we will go through several essential ingredients. The references [1] which this survey is mainly based on) 2] [7], and [4] give more or complementary details. Indeed, let us consider brie y what the PCP theorem actually says. Trivially, any language...
Cited by: More
Special Course on Cryptology / Zero Knowledge: A first look at the .. - Kojo (2001) (Correct)
Active bibliography (related documents): More All
0.3: Query-Efficient Checking of Proofs and Improved PCP.. - Guruswami (1999) (Correct)
0.2: A tight characterization of NP with 3 query PCPs - Guruswami, Lewin, Sudan.. (1998) (Correct)
0.2: Interactive and Probabilistic Proof-Checking - Trevisan (2000) (Correct)
Similar documents based on text: More All
1.0: Probabilistically Checkable Proofs with Low Amortized Query.. - Sudan, Trevisan (1998) (Correct)
0.7: Probabilistic Verification of Proofs - Sudan (1998) (Correct)
0.6: Query efficient PCPs with perfect completeness - Håstad, Khot (2001) (Correct)
BibTeX entry: (Update)
Madhu Sudan, Probabilistically Checkable Proofs, Lecture notes, IAS/Park City Mathematics Series, Scribe: Venkatesan Guruswami. http://citeseer.ist.psu.edu/487182.html More
@misc{ sudan-probabilistically,
author = "M. Sudan",
title = "Probabilistically Checkable Proofs",
text = "Madhu Sudan, Probabilistically Checkable Proofs, Lecture notes, IAS/Park
City Mathematics Series, Scribe: Venkatesan Guruswami.",
url = "citeseer.ist.psu.edu/487182.html" }
Citations (may not include all citations):415 Improved approximation algorithms for maximum cut and satisf.. - Goemans, Williamson - 1995
403 Proof verification and hardness of approximation problems - Arora, Lund et al. - 1998
242 Non-deterministic exponential time has two-prover interactiv.. - Babai, Fortnow et al. - 1991
212 Probabilistic checking of proofs: A new characterization of .. - Arora, Safra - 1998
173 Trading group theory for randomness (context) - Babai - 1985
155 Checking computations in polylogarithmic time - Babai, Fortnow et al. - 1991
126 Efficient probabilistically checkable proofs and application.. - Bellare, Goldwasser et al. - 1993
118 A parallel repetition theorem - Raz - 1998
115 Robust characterizations of polynomials with applications to.. - Rubinfeld, Sudan - 1996
108 Improved non-approximability results - Bellare, Sudan - 1994
108 Hardness of approximations - Arora, Lund - 1996
94 Self testingcorrecting with application to numerical problem - Michael, Ronitt et al. - 1993
94 Interactive proofs and the hardness of approximating cliques - Feige, Goldwasser et al. - 1996
93 the power of multiprover interactive protocols - Fortnow, Rompel et al. - 1994
88 The knowledge complexity of interactive proofs (context) - Goldwasser, Micali et al. - 1989
83 Multiprover interactive proofs: How to remove intractability.. (context) - Ben-Or, Goldwasser et al. - 1988
55 approximation algorithm for MAX 3SAT - Karloff, Zwick - 1997
50 Nearly-linear size holographic proofs (context) - Polishchuk, Spielman - 1994
47 Clique is hard to approximate within n 1\Gammaffl (context) - Hastad
45 Two prover protocols -- low error at affordable rates (context) - Feige, Kilian - 1994
44 PCP's and non-approximability -- towards tight results (context) - Bellare, Goldreich et al. - 1998
39 Approximation algorithms for constraint satisfaction problem.. - Zwick - 1998
26 A PCP characterization of NP with optimal amortized query co.. - Samorodnitsky, Trevisan - 2000
26 Recycling queries in PCPs and in linearity tests (context) - Trevisan - 1998
20 A tight characterization of NP with 3-query PCPs - Guruswami, Lewin et al. - 1998
16 Electronic Colloquium on Computational Complexity (context) - Hastad, inapproximability et al. - 1997
11 Probabilistically checkable proofs with low amortized query .. - Sudan, Trevisan - 1998
8 Linearity testing over characteristic two (context) - Bellare, Coppersmith et al. - 1996
6 of the 7th Annual Symposium on Theoretical Aspects of Comput.. (context) - Beaver, Feigenbaum et al. - 1990
Online articles have much greater impact More about CiteSeer.IST Add search form to your site Submit documents Feedback
CiteSeer.IST - Copyright Penn State and NEC