On the advantage over a random assignment

Random Structures and Algorithms

Volumn 25, Issue 2, 2004, Pages 117-149

  Håstad, Johan ^a   Venkatesh, S ^b  

^a ROYAL INSTITUTE OF TECHNOLOGY   (Sweden)

^b RUTGERS UNIVERSITY   (United States)

Author keywords

Approximation algorithms; Inapproximability; Linear system of equations; PCP; Satisfiability

Indexed keywords

EID: 11144258880     PISSN: 10429832     EISSN: None     Source Type: Journal    
DOI: 10.1002/rsa.20031     Document Type: Article

References (16)

1. N. Alon, U. Feige, A. Wigderson, and D. Zuckerman, Derandomized graph products, Comput Complexity 5 (1995), 60-76.
2. N. Alon, G. Gutin, and M. Krivelevich, Algorithms with large domination ratio, J Algorithms 50 (2004), 118-131.
3. N. Alon and J. Spencer, The probabilistic method, Wiley-Interscience, New York, 2000.
4. S. Arora, C. Lund, R. Motwani, M. Sudan, and M. Szegedy, Proof verification and intractability of approximation problems, J ACM 45(3) (1998), 501-555.
5. S. Arora and S. Safra, Probabilistic checking of proofs: A new characterization of NP, J ACM 45(1) (1998), 70-122.
6. W. Beckner, Inequalities in Fourier analysis, Ann of Math 102 (1975), 159-182.
7. M. Bellare, O. Goldreich, and M. Sudan, Free bits, PCPs and non-approximability - towards tight results, SIAM J Comput 27 (1998), 804-915.
8. M. Bellare and P. Rogaway, The complexity of approximating a nonlinear program, J Math Program B 69(3) (1995), 429-441.
9. p(G), Ann Inst Fourier (Grenoble), 20(2) (1970), 335-402.
10. M. Blum, A. Kalai, and H. Wasserman, Noise-tolerant learning, the parity problem and the statistical query model, Proc 32nd Annu ACM Symp Theory of Computation, 2000, pp. 435-440.
11. L. Engebretsen and J. Holmerin, Towards optimal lower bounds for clique and chromatic number, Theoret Comput Sci 299(1-3) (2003), 537-584.
12. S. Khot, Hardness results for approximate hypergraph coloring, Proc 34th Annu ACM Symp Theory of Computing, 2002, pp. 351-359.
13. S. Khot, Inapproximability results for max-clique, chromatic number and approximate graph coloring, Proc 42nd IEEE Conf Foundations of Computer Science, 2001, pp. 600-609.
14. J. Håstad, Some optimal inapproximability results, J ACM 48 (2001), 798-859.
15. A. Lubotzky, R. Philips, and P. Sarnak, Ramanujan graphs, Combinatorica 8(3) (1988), 261-277.
16. R. Raz, A parallel repetition theorem, SIAM J Comput 27(3) (1998), 763-803.