Randomly supported independence and resistance

SIAM Journal on Computing

Volumn 40, Issue 1, 2011, Pages 1-27

  Austrin, Per ^a   Hastad, Johan ^b  

^a UNIVERSITY OF TORONTO   (Canada)

^b ROYAL INSTITUTE OF TECHNOLOGY   (Sweden)

Author keywords

Approximation resistance; Constraint satisfaction; K wise independence

Indexed keywords

APPROXIMATION RESISTANCE; CARDINALITIES; CONSTRAINT SATISFACTION; HIGH PROBABILITY; INPUT VECTOR; IS APPROXIMATION; K-WISE INDEPENDENCE; POSITIVE INTEGERS; PRODUCT DISTRIBUTIONS; RANDOM SET; UNIQUE GAMES CONJECTURE;

PROBABILITY DISTRIBUTIONS;

EID: 79952948997     PISSN: 00975397     EISSN: None     Source Type: Journal    
DOI: 10.1137/100783534     Document Type: Article

References (25)

1. S. Arora, B. Barak, and D. Steurer, Subexponential algorithms for unique games and related problems, in Proceedings of the 51st Annual IEEE Symposium on Foundations of Computer Science (FOCS 2010), Las Vegas, NV, 2010, IEEE Press, Piscataway, NJ, pp. 563-572.
2. S. Arora, S. Khot, A. Kolla, D. Steurer, M. Tulsiani, and N. K. Vishnoi, Unique games on expanding constraint graphs are easy, in Proceedings of the 40th Annual ACM Symposium on Theory of Computing (STOC), Victoria, BC, 2008, ACM, New York, pp. 21-28.
3. P. Austrin, Conditional Inapproximability and Limited Independence, Ph.D. thesis, School of Computer Science and Communication, KTH-Royal Institute of Technology, Stockholm, Sweden, 2008.
4. P. Austrin and E. Mossel, Approximation resistant predicates from pairwise independence, Comput. Complexity, 18 (2009), pp. 249-271.
5. W. Beckner, Inequalities in Fourier analysis, Ann. of Math., 102 (1975), pp. 159-182.
6. p(G), Ann. Inst. Fourier (Grenoble), 20 (1970), pp. 335-402.
7. M. Charikar, K. Makarychev, and Y. Makarychev, Near-optimal algorithms for unique games, in Proceedings of the 38th Annual ACM Symposium on Theory of Computing (STOC), Seattle, WA, 2006, ACM, New York, pp. 205-214. (Pubitemid 44306554)
8. I. Dinur, E. Friedgut, G. Kindler, and R. O'Donnell, On the Fourier tails of bounded functions over the discrete cube, Israel J. Math., 160 (2007), pp 389-412.
9. Z. Füredi, Random polytopes in the d-dimensional cube, Discrete Comput. Geom., 1 (1986), pp. 315-319.
10. M. X. Goemans and D. P. Williamson, Improved approximation algorithms for maximum cut and satisfiability problems using semidefinite programming, J. ACM, 42 (1995), pp. 1115-1145.
11. V. Guruswami, D. Lewin, M. Sudan, and L. Trevisan, A tight characterization of NP with 3 query PCPs, in Proceedings of the 39th Annual IEEE Symposium on Foundations of Computer Science (FOCS), Palo Alto, CA, 1998, IEEE, Piscataway, NJ, 1998, pp. 8-17.
12. G. Hast, Beating a Random Assignment-Approximating Constraint Satisfaction Problems, Ph.D. thesis, School of Computer Science and Communication, KTH-Royal Institute of Technology, Stockholm, Sweden, 2005.
13. J. Håstad, Some optimal inapproximability results, J. ACM, 48 (2001), pp. 798-859.
14. J. Håstad, Every 2-CSP allows nontrivial approximation, Comput. Complexity, 17 (2008), pp. 549-566.
15. J. Håstad, On the approximation resistance of a random predicate, Comput. Complexity, 18 (2009), pp. 413-434.
16. S. Janson, Gaussian Hilbert Spaces, Cambridge University Press, Cambridge, UK, 1997.
17. S. Khot, On the power of unique 2-prover 1-round games, in Proceedings of the 34th Annual ACM Symposium on Theory of Computing (STOC), Montréal, QC, 2002, IEEE Press, Piscataway, NJ, pp. 767-775. (Pubitemid 35009440)
18. M. Kochol, Constructive approximation of a ball by polytopes, Math. Slovaca, 44 (1994), pp. 99-105.
19. A. Kolla, Spectral algorithms for unique games, in Proceedings of the 26th IEEE Conference on Computational Complexity (CCC), San Jose, CA, 2010, IEEE Press, Piscataway, NJ, pp. 122-130.
20. E. Mossel, Gaussian bounds for noise correlation of functions, Geom. Funct. Anal., 19 (2010), pp. 1713-1756.
21. A. Samorodnitsky and L. Trevisan, A PCP characterization of NP with optimal amortized query complexity, in Proceedings of the 32nd Annual ACM Symposium on Theory of Computing (STOC), Portland, OR, 2000, IEEE Press, Piscataway, NJ, pp. 191-199.
22. A. Samorodnitsky and L. Trevisan, Gowers uniformity, influence of variables, and PCPs, in Proceedings of the 38th ACM Symposium on Theory of Computing (STOC), Seattle, WA, 2006, ACM, New York, pp. 11-20. (Pubitemid 44306533)
23. L. Trevisan, Approximation algorithms for unique games, Theory Comput., 4 (2008), pp. 111-128.
24. P. Wolff, Hypercontractivity of simple random variables, Studia Math., 180 (2007), pp. 219-236.
25. U. Zwick, Approximation algorithms for constraint satisfaction problems involving at most three variables per constraint, in Proceedings of the Ninth Annual ACM-SIAM Symposium on Discrete Algorithms (SODA), San Francisco, CA, 1998, SIAM, Philadelphia, 1998, pp. 201-210.