Mihir Bellare, Oded Goldreich, Madhu Sudan  Home/Search
Context Related
| mit.edu/pub/people/oded/bgs3.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/~oded/bgs (more) (Enter author homepages) |
Rate this article:      (best)Comment on this article |
Abstract: This paper continues the investigation of the connection between proof systems and approximation. The emphasis is on proving tight non-approximability results via consideration of measures like the "free bit complexity" and the "amortized free bit complexity" of proof systems. (Update)
Context of citations to this paper: More
...the size of the maximum clique within a factor of n , unless P = NP . More recent developments along these lines can be found in [15, 16, 34]. In the light of these negative results, much effort has recently been directed towards devising efficient heuristics for the MCP, for...
.... the hypothesis NP #= P we can derive from the new theory of probabilistically checkable proof systems (Bellare, Goldreich and Sudan [1]) that the problem has neither approximation schemes nor polynomial time approximation algorithms whose results are only by a constant factor...
Cited by: More
Tight Inapproximability Results - Lecture June We (Correct)
Exact Solution of the Quadratic Knapsack Problem - Caprara, Pisinger, Toth (1998) (Correct)
Randomized graph products, chromatic numbers, and the.. - Feige (1996) (Correct)
Similar documents (at the sentence level):
61.4%: Free Bits, PCPs and Non-Approximability--- - Towards Tight Results (Correct)
61.0%: Free Bits, PCPs and Non-Approximability - Towards Tight.. - Bellare, Goldreich.. (1995) (Correct)
59.6%: Free Bits, PCPs and Non-Approximability - Towards Tight.. - Bellare, Goldreich, Sudan (1995) (Correct)
Active bibliography (related documents): More All
0.8: Proof Checking and Approximation: Towards Tight Results - Bellare (1996) (Correct)
0.6: Free Bits and Non-Approximability (Extended Abstract) - Bellare, Goldreich, Sudan (Correct)
0.5: The Weizmann Workshop on Probabilistic Proof Systems - Feige, (Eds.) (1994) (Correct)
Similar documents based on text: More All
0.3: Improved Non-Approximability Results - Bellare, Sudan (1994) (Correct)
0.3: Linearity Testing in Characteristic Two - Bellare, Coppersmith.. (1995) (Correct)
Related documents from co-citation: More All
4: Proof verification and hardness of approximation problems - Lund, Motwani et al. - 1992
3: Computers and Intractability: A Guide to the Theory of NP-Completeness (context) - Garey, Johnson - 1979
2: Quadratic Knapsack Problems (context) - Gallo, Hammer et al. - 1976
BibTeX entry: (Update)
M. Bellare, M. Goldreich and M. Sudan, "Free bits PCPs and non-approximability --- towards tight results," FOCS95, pp.422--431, 1995. http://citeseer.ist.psu.edu/article/bellare95free.html More
@inproceedings{ bellare95free,
author = "Mihir Bellare and Oded Goldreich and Madhu Sudan",
title = "Free Bits, {PCPs} and Non-Approximability - Towards Tight Results",
booktitle = "{IEEE} Symposium on Foundations of Computer Science",
pages = "422-431",
year = "1995",
url = "citeseer.ist.psu.edu/article/bellare95free.html" }
Citations (may not include all citations):4212 Computers and Intractability: A Guide to the Theory of NP-Co.. (context) - Garey, Johnson - 1979
957 The Probabilistic Method (context) - Alon, Spencer et al. - 1992
860 The Theory of Error-Correcting Codes (context) - MacWilliams, Sloane - 1981
837 Cambridge University Press (context) - Motwani, Raghavan - 1995
773 Reducibility among combinatorial problems (context) - Karp - 1972
534 The Complexity of Theorem-Proving Procedures (context) - Cook - 1971
300 the hardness of approximating minimization problems (context) - Lund, Yannakakis - 1994
242 Non-deterministic Exponential time has twoprover interactive.. - Babai, Fortnow et al. - 1990
225 Some simplified NP-complete graph problems (context) - Garey, Johnson et al. - 1976
219 and complexity classes (context) - Papadimitriou, Yannakakis et al. - 1991
212 Probabilistic checking of proofs: a new characterization of .. - Arora, Safra - 1992
203 Approximating clique is almost NP-complete (context) - Feige, Goldwasser et al. - 1991
173 Proof verification and intractability of approximation probl.. (context) - Arora, Lund et al. - 1992
173 Trading Group Theory for Randomness (context) - Babai - 1985
172 Algebraic Methods for Interactive Proof Systems - Lund, Fortnow et al. - 1990
155 Checking computations in polylogarithmic time - Babai, Fortnow et al. - 1991
143 the complexity of timetable and multicommodity flow problems (context) - Even, Itai et al. - 1976
126 Efficient probabilistically checkable proofs and application.. - Bellare, Goldwasser et al. - 1994
122 How to Recycle Random Bits - Impagliazzo, Zuckerman - 1989
120 The hardness of approximate optima in lattices (context) - Arora, Babai et al. - 1993
118 A parallel repetition theorem - Raz - 1995
115 PCPs and Non-Approximability --- Towards Tight Results (context) - Bellare, Goldreich et al. - 1995
115 Approximating the value of two prover proof systems (context) - Feige, Goemans - 1995
110 Proofs that yield nothing but their validity and a methodolo.. (context) - Goldreich, Micali et al. - 1986
108 Improved non-approximability results - Bellare, Sudan - 1994
107 complete approximation problems (context) - Sahni, Gonzales - 1976
106 approximation algorithms for Max-CUT and Max-2SAT (context) - Goemans, Williamson - 1994
104 Approximating maximum independent sets by excluding subgraph.. - Boppana, Hald'orsson - 1992
99 Approximate graph coloring by semidefinite programming - Karger, Motwani et al. - 1994
98 Private Coins versus Public Coins in Interactive Proof Syste.. (context) - Goldwasser, Sipser - 1986
94 Self testingcorrecting with application to numerical problem - Luby, testing et al. - 1993
93 the power of multiprover interactive protocols - Fortnow, Rompel et al. - 1988
88 Deterministic Simulation in Logspace (context) - Ajtai, Komlos et al. - 1987
88 The knowledge complexity of interactive proofs (context) - Goldwasser, Micali et al. - 1989
85 the approximation of maximum satisfiability (context) - Yannakakis - 1994
70 Two theorems on random polynomial time (context) - Adleman - 1978
69 Two-prover one round proof systems: Their power and their pr.. (context) - Feige, Lov'asz - 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 complexity of promise problems with applications to publ.. (context) - Even, Selman et al. - 1984
54 and weak random sources (context) - Cohen, Wigderson et al. - 1989
50 Nearly-linear size holographic proofs (context) - Polishchuk, Spielman - 1994
49 Fully Parallelized Multi-prover protocols for NEXP-time (context) - Lapidot, Shamir - 1991
48 The complexity and approximability of finding maximum feasib.. - Amaldi, Kann - 1995
45 Randomness in interactive proofs - Bellare, Goldreich et al. - 1990
45 Two prover protocols -- Low error at affordable rates (context) - Feige, Kilian - 1994
40 Explicit Expanders and the Ramanujan Conjectures (context) - Lubotzky, Phillips et al. - 1986
40 Linearity testing in characteristic two - Bellare, Coppersmith et al. - 1994
39 On Completeness and Soundness in Interactive Proof Systems - Furer, Goldreich et al. - 1989
38 the hardness of approximating MAX k-CUT and its dual - Kann, Khanna et al. - 1995
37 To Weight or not to Weight: Where is the Question - Crescenzi, Silvestri et al. - 1995
37 Information Processing Letters (context) - Lautemann, the - 1983
36 La Sapienza (context) - Crescenzi, Kann et al. - 1995
34 The complexity of near optimal graph coloring (context) - Garey, Johnson - 1976
32 A local ratio theorem for approximating the weighted vertex .. (context) - Bar-Yehuda, Even - 1985
25 vertex cover and set packing problems (context) - Hochbaum, for et al. - 1983
21 A linear time approximation algorithm for the weighted verte.. (context) - Bar-Yehuda, Even - 1981
20 Algorithms for approximate graph coloring - Blum - 1991
18 New problems complete for nondeterministic log space (context) - Jones, Lien et al. - 1976
17 Multi-Prover interactive proofs: How to remove intractabilit.. (context) - Ben-Or, Goldwasser et al. - 1988
17 Universal'nyie perebornyie zadachi (context) - Levin - 1973
16 New 3/4-approximation algorithm for MAX SAT - Goemans, Williamson - 1993
16 Improved hardness results for approximating the chromatic nu.. (context) - Furer - 1994
16 the second eigenvalue and linear expansion of regular graphs (context) - Kahale - 1992
15 Interactive proofs and approximation: reductions from two pr.. - Bellare - 1993
15 Some further approximation algorithms for the vertex cover p.. (context) - Speckenmeyer - 1983
13 NP-Complete Problems have a version that is hard to Approxim.. (context) - Zuckerman - 1993
12 Multi-prover encoding schemes and three prover proof systems - Tardos - 1994
9 PCPs and Inapproximability (context) - Arora, Codes - 1995
9 and the Lov'asz theta function (context) - Feige, products et al. - 1995
7 Technion -- Israel Institute of Technology (context) - Petrank, of et al. - 1992
6 On approximation problems related to the independent set and.. (context) - Bar-Yehuda, Moran - 1984
5 The complexity of approximating a quadratic program (context) - Bellare, Rogaway - 1993
5 The hardness of decoding with preprocessing (context) - Bruck, Naor - 1990
3 Trevisan and D (context) - Sorkin, Sudan - 1995
2 private communication (context) - astad - 1995
The graph only includes citing articles where the year of publication is known.
Documents on the same site (http://theory.lcs.mit.edu/~oded/bgs.html): More
Free Bits, PCPs and Non-Approximability--- - Towards Tight Results (Correct)
Free Bits, PCPs and Non-Approximability - Towards Tight.. - Bellare, Goldreich, Sudan (1995) (Correct)
Free Bits, PCPs and Non-Approximability - Towards Tight.. - Bellare, Goldreich, Sudan (1995) (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