Noga Alon, Uriel Feige, Avi Wigderson, David Zuckerman  Home/Search
Context Related
| cs.huji.ac.il/~avi/AFWZ.ps ias.edu/~avi/AFWZ.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: cs.huji.ac.il/~avi/papers (more) Homepages: A.Wigderson |
Rate this article:      (best)Comment on this article |
Abstract: Berman and Schnitger [10] gave a randomized reduction from approximating MAXSNP problems [24] within constant factors arbitrarily close to 1 to approximating clique within a factor of n^ε (for some ε). This reduction was further studied by Blum [11], who gave it the name randomized graph products. We show that this reduction can be made deterministic (derandomized), using random walks on expander graphs [1]. The main technical contribution of this paper is in lower bounding the... (Update)
Similar documents based on text: More All
0.4: Derandomized Graph Products - Alon, Feige, Wigderson, Zuckerman (1995) (Correct)
0.3: Sampling Vertex Degrees and Estimating Network Load Parameters - Feige (2003) (Correct)
0.3: Relations Between Average Case Complexity and Approximation.. - Feige (2002) (Correct)
Related documents from co-citation: More All
12: the complexity of approximating the independent set problem (context) - Berman, Schnitger - 1989
11: The Probabilistic Method (context) - Alon, Spencer - 1992
10: Probabilistic checking of proofs: A new characterization of NP - Arora, Safra - 1992
BibTeX entry: (Update)
N. Alon, U. Feige, A. Wigderson and D. Zuckerman, Derandomized graph products, Comput. Complex., Vol. 5: 60--75, 1995. http://citeseer.ist.psu.edu/alon96derandomized.html More
@article{ alon95derandomized,
author = "Noga Alon and Uriel Feige and Avi Wigderson and David Zuckerman",
title = "Derandomized Graph Products",
journal = "Computational Complexity",
volume = "5",
number = "1",
pages = "60--75",
year = "1995",
url = "citeseer.ist.psu.edu/alon96derandomized.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
403 Proof Verification and Hardness of Approximation Problems - Arora, Lund et al. - 1992
203 Approximating Clique is Almost NP-complete (context) - Feige, Goldwasser et al. - 1991
126 Eigenvalues and expanders (context) - Alon - 1986
122 How to Recycle Random Bits - Impagliazzo, Zuckerman - 1989
88 Deterministic Simulation in Logspace (context) - Ajtai, Koml'os et al. - 1987
84 Simulating BPP Using a General Weak Random Source - Zuckerman - 1991
71 Explicit Constructions of Linear Sized Superconcentrators (context) - Gabber, Galil - 1981
68 Explicit group-theoretical constructions of combinatorial sc.. (context) - Margulis - 1988
63 the Complexity of Approximating the Independent Set Problem (context) - Berman, Schnitger - 1992
60 A Survey of Matrix Theory and Matrix Inequalities (context) - Marcus, Minc - 1964
48 The complexity and approximability of finding maximum feasib.. - Amaldi, Kann
47 Optimization, Approximation, and Complexity Classes (context) - Papadimitriou, Yannakakis - 1991
45 Randomness in Interactive Proofs - Bellare, Goldreich et al. - 1990
33 Probabilistic Checking of Proofs; A New Characterization of .. (context) - Arora, Safra - 1992
26 Approximating maximum independent set in bounded degree grap.. (context) - Berman, Furer - 1994
24 Ramanujan Graphs (context) - Lubotsky, Phillips et al. - 1988
19 Greed is good: approximating independent sets in sparse and .. (context) - Halldorsson, Radhakrishnan - 1994
18 Dispersers, deterministic amplification, and weak random sou.. - Cohen, Wigderson - 1989
17 Better Expansion for Ramanujan Graphs (context) - Kahale - 1992
15 Graph Products and Chromatic Numbers (context) - Linial, Vazirani - 1989
2 The Hardness of Approximate Optima in Lattices, Codes and Li.. (context) - Arora, Babai et al. - 1993
The graph only includes citing articles where the year of publication is known.
Documents on the same site (http://www.cs.huji.ac.il/~avi/papers.html): More
Monotone Circuits for Matching Require Linear Depth - Raz, Wigderson (1996) (Correct)
Monotone Circuits for Matching Require Linear Depth - Raz, Wigderson (1996) (Correct)
BPP has Subexponential Time Simulations unless EXPTIME has.. - Babai, Nissan (1993) (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