Sanjeev Arora, Carsten Lund, Rajeev Motwani, Madhu Sudan, Mario Szegedy  Home/Search
Context Related
Links: ACM DBLP | mit.edu/~madhu/papers/almssjourn.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: mit.edu/~madhu/npapers (more) (Enter author homepages) |
Rate this article:      (best)Comment on this article |
Abstract: We show that every language in NP has a probablistic verifier that checks membership proofs for it using logarithmic number of random bits and by examining a constant number of bits in the proof. If a string is in the language, then there exists a proof such that the verifier accepts with probability 1 (i.e., for every choice of its random string). For strings not in the language, the verifier rejects every provided "proof" with probability at least 1/2. Our result builds upon and improves a... (Update)
Cited by: More
Energy Minimization via Graph Cuts: Settling What is Possible - Daniel Freedman And (Correct)
New Upper Bounds for Maximum Satisfiability - Niedermeier, Rossmanith (2000) (Correct)
Confronting Hardness Using a Hybrid Approach - Vassilevska, Williams, Woo (2005) (Correct)
Similar documents (at the sentence level):
46.8%: Proof Verification and the Hardness of Approximation.. - Arora, Lund, Motwani.. (1992) (Correct)
Active bibliography (related documents): More All
1.6: Improved Low-Degree Testing and Its Applications - Arora (2001) (Correct)
1.1: The Approximability of NP-hard Problems - Arora (1998) (Correct)
0.9: The Weizmann Workshop on Probabilistic Proof Systems - Feige, (Eds.) (1994) (Correct)
Similar documents based on text: More All
0.7: Using the FGLSS-reduction to Prove Inapproximability Results for .. - Goldreich (2001) (Correct)
0.3: On the Role of Algebra in the Efficient Verification of Proofs - Sudan (1994) (Correct)
0.3: On Syntactic versus Computational Views of Approximability - Khanna, Motwani, Sudan.. (1994) (Correct)
Related documents from co-citation: More All
29: Computers and Intractability: A Guide to the Theory of NP-Completeness (context) - Garey, Johnson - 1979
23: the hardness of approximating minimization problems (context) - Lund, Yannakakis - 1993
21: Approximating clique is almost NP-complete (context) - Feige, Goldwasser et al. - 1991
BibTeX entry: (Update)
Arora, Lund C., Motwani R., Sudan M., Szegedy M.: Proof verification and hardness of approximation problems. Proceedings of the 33rd IEEE Symposium on Foundations on Computer Science, 1992, 14-23. http://citeseer.ist.psu.edu/lund92proof.html More
@inproceedings{ arora92proof,
author = "Sanjeev Arora and Carsten Lund and Rajeev Motwani and Madhu Sudan and Mario Szegedy",
title = "Proof Verification and Hardness of Approximation Problems",
booktitle = "{IEEE} Symposium on Foundations of Computer Science",
pages = "14--23",
year = "1992",
url = "citeseer.ist.psu.edu/lund92proof.html" }
Citations (may not include all citations):4212 Computers and Intractability: A Guide to the Theory of NP-Co.. (context) - Garey, Johnson - 1979
773 Reducibility among combinatorial problems (context) - Karp - 1972
534 The complexity of theorem-proving procedures (context) - Cook - 1971 ACM DBLP
531 The knowledge complexity of interactive proof-systems (context) - Goldwasser, Micali et al. - 1989 ACM
415 Improved approximation algorithms for maximum cut and satisa.. - Goemans, Williamson - 1995
300 the hardness of approximating minimization problems (context) - Lund, Yannakakis - 1994
293 Approximation algorithms for combinatorial problems (context) - Johnson - 1974
242 Non-deterministic exponential time has twoprover interactive.. - Babai, Fortnow et al. - 1991
212 Probabilistic checking of proofs: a new characterization of .. - Arora, Safra - 1992 DBLP
192 Designing Programs that Check Their Work - Blum, Kannan - 1989 ACM DBLP
187 Polynomial-time approximation schemes for Euclidean TSP and .. - Arora - 1996
173 Trading group theory for randomness (context) - Babai - 1985 ACM DBLP
172 Algebraic Methods for Interactive Proof Systems - Lund, Fortnow et al. - 1992 ACM DBLP
170 Bounds for certain multiprocessing anomalies (context) - Graham - 1966
155 Checking computations in polylogarithmic time - Babai, Fortnow et al. - 1991 ACM DBLP
132 Hiding instances in multioracle queries (context) - Beaver, Feigenbaum - 1990 ACM DBLP
127 Guillotine subdivisions approximate polygonal subdivisions: .. - Mitchell - 1996
122 How to Recycle Random Bits - Impagliazzo, Zuckerman - 1989 DBLP
120 The hardness of approximate optima in lattices (context) - Arora, Babai et al. - 1997
118 A parallel repetition theorem - Raz - 1995 ACM DBLP
115 Robust characterizations of polynomials with applications to.. - Rubinfeld, Sudan - 1996 DBLP
108 Improved non-approximability results - Bellare, Sudan - 1994
108 Hardness of approximations - Arora, Lund - 1996 ACM
107 complete approximation problems (context) - Sahni, Gonzales - 1976
104 approximation and complexity classes (context) - Papadimitriou, Yannakakis - 1991
98 Zero knowledge and chromatic number - Feige, Kilian - 1996
98 Error correction of algebraic block codes (context) - Welch, Berlekamp - 1986
96 Fast approximation algorithms for the knapsack and sum of su.. (context) - Ibarra, Kim - 1975 ACM DBLP
95 A sub-constant error-probability low-degree test - Raz, Safra - 1997
94 Self testingcorrecting with application to numerical problem - Luby, testing et al. - 1993
94 Interactive proofs and the hardness of approximating cliques - Feige, Goldwasser et al. - 1996
93 the power of multi-prover interactive protocols - Fortnow, Rompel et al. - 1994
88 The traveling salesman problem with distances one and two (context) - Papadimitriou, Yannakakis - 1992 ACM
87 Arthur-Merlin games: a randomized proof system (context) - Babai, Moran - 1988
86 New directions in testing (context) - Lipton - 1991
83 On syntactic versus computational views of approximability - Khanna, Motwani et al. - 1994 ACM DBLP
83 Multi-prover interactive proofs: How to remove intractabilit.. (context) - Ben-Or, Goldwasser et al. - 1988 DBLP
82 Improved low degree testing and its applications - Arora, Sudan - 1997
69 Two-prover one-round proof systems: Their power and their pr.. (context) - Feige, Lov - 1992
69 Some optimal inapproximability results (context) - astad - 1997 ACM DBLP
65 Journal of the ACM (context) - Shamir, PSPACE - 1992
63 the complexity of approximating the independent set problem (context) - Berman, Schnitger - 1992
62 the hardness of approximating the chromatic number - Khanna, Linial et al. - 1993
61 The steiner problem with edge lengths 1 and (context) - Bern, Plassmann - 1989
55 The complexity of multiway cuts (context) - Dahlhaus, Johnson et al. - 1994
54 and weak random sources (context) - Cohen, Wigderson et al. - 1989
49 Fully parallelized multi-prover protocols for NEXP-time (context) - Lapidot, Shamir - 1997 ACM DBLP
48 Linear approximation of shortest superstrings - Blum, Jiang et al. - 1994 ACM DBLP
43 Selftesting /correcting for polynomials and for approximate .. - Gemmell, Lipton et al. - 1991
43 Highly resilient correctors for polynomials - Gemmell, Sudan - 1992
42 Probabilistic Checking of Proofs and Hardness of Approximati.. (context) - Arora - 1994 ACM
41 Structure Preserving Reductions among Convex Optimization Pr.. (context) - Ausiello, D'Atri et al. - 1980 DBLP
40 Linearity testing in characteristic two - Bellare, Coppersmith et al. - 1996 ACM DBLP
40 Arithmetization: a new method in structural complexity theor.. - Babai, Fortnow - 1991 ACM DBLP
40 The approximation of maximum subgraph problems (context) - Lund, Yannakakis - 1993 ACM DBLP
36 The complexity of approximating a nonlinear program - Bellare, Rogaway ACM
35 On approximating the longest path in a graph - Karger, Motwani et al. - 1997 DBLP
34 The complexity of near-optimal graph coloring (context) - Garey, Johnson - 1976
34 The decision problem for the probabilities of higherorder pr.. (context) - Kolaitis, Vardi - 1987
30 Lecture Notes on Approximation Algorithms (context) - Motwani - 1992
30 Some simplied NP-complete graph problems (context) - Garey, Johnson et al. - 1976
28 Fast Probabilistic Algorithms (context) - Freivalds - 1979 DBLP
26 Maximum bounded 3-dimensional matching is MAX SNP-complete (context) - Kann - 1991 ACM
24 Probabilistically Checkable Debate Systems and Approximation.. - Condon, Feigenbaum et al. - 1993 ACM DBLP
23 of Self-Checking, Self-Testing and SelfCorrecting Programs (context) - Rubinfeld, Theory - 1990
21 Non-deterministic polynomial optimization problems and their.. (context) - Paz, Moran - 1981 ACM DBLP
21 Clique is hard to approximate within n (context) - astad - 1996
19 Random debaters and the hardness of approximating stochastic.. - Condon, Feigenbaum et al. - 1997 ACM DBLP
19 A survey of Russian approaches to Perebor (context) - Trakhtenbrot - 1984
17 PSPACE is provable by two provers in one round - Cai, Condon et al. - 1994 ACM DBLP
17 Generalized rst-order spectra and polynomial-time recognizab.. (context) - Fagin - 1974
15 Interactive proofs and approximation: reductions from two pr.. - Bellare - 1993
14 the approximation of maximum satisability (context) - Yannakakis - 1994
14 An Ecient Approximation Scheme For The OneDimensional Bin Pa.. (context) - Karmakar, Karp - 1982
13 Some improvements to low-degree tests (context) - Friedl, Sudan - 1995
12 Multi-prover encoding schemes and three prover proof systems - Tardos - 1994
11 Testing of the long code and hardness for clique (context) - astad - 1996 ACM DBLP
8 Program checking (context) - Blum ACM DBLP
8 On slightly superlinear transparent proofs (context) - Babai, Friedl - 1993 ACM
8 PCP and tighter bounds for approximating MAXSNP (context) - Phillips, Safra - 1992
7 A Taxonomy of Proof Systems - Goldreich - 1997 ACM
6 A threshold of ln n for Set Cover (context) - Feige - 1996
6 Approximate algorithms for the 0/1 knapsack problem (context) - Sahni - 1975 ACM DBLP
6 Low-degree testing (context) - Friedl, ats et al. - 1994
6 Two prover protocols { Low error at a ordable rates (context) - Feige, Kilian - 1994
5 PCP and approximation problems (context) - Arora, Motwani et al. - 1992
5 NP-completeness results: motivation (context) - Garey, Johnson - 1978
5 or the power of one-way interactive proof systems (context) - Condon, of et al. - 1991
5 Nearly Linear Sized Holographic Proofs (context) - Polishchuk, Spielman - 1994
5 Improved hardness results for approximating the chromatic nu.. (context) - urer - 1995 ACM DBLP
4 Ecient Checking of Polynomials and Proofs and the Hardness o.. (context) - Sudan
3 Ecient probabilistically checkable proofs (context) - Bellare, Goldwasser et al.
3 Bin Packing can be solved within 1 + in Linear Time (context) - Vega, Lueker - 1981
3 A corrected English translation appears in an appendix to Tr.. (context) - Levin, pereborny et al. - 1973
2 Probabilistic algorithms for verication of polynomial identi.. (context) - Schwartz - 1980
2 Towards a Unied Approach for the Classication of NP-complete.. (context) - Ausiello, Marchetti-Spaccamela et al. - 1980
1 The latest version is available by anonymous ftp from nada (context) - Crescenzi, Kann et al. - 1995
The graph only includes citing articles where the year of publication is known.
Documents on the same site (http://theory.lcs.mit.edu/~madhu/npapers.html): More
Computational Indistinguishability: A Sample Hierarchy - Goldreich, Sudan (2001) (Correct)
Small PCPs with Low Query Complexity - Harsha, Sudan (2000) (Correct)
Improved Decoding of Reed-Solomon and Algebraic-Geometric Codes - Guruswami, Sudan (1998) (Correct)
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