Subhash Khot
Abstract
Summer has come again. And what better way is there to spend a summer than to relax on a sandy beach, on a mountain top, or at a park's picnic tables, and... think theory! Summer is a particularly good time to attack the big questions whose openness just plain annoys you. In light of Reingold's L = SL result, does L-vs.-RL tempt you? If so, take it on! (But perhaps peek first at Reingold--Trevisan--Vadhan's ECCC TR05-022.) Are you convinced that UP = NP should imply the collapse of the polynomial hierarchy? Make it so! (But if you hope to do so via showing that UP is contained in the low hierarchy, peek first at Long--Sheu's 1996 MST article.) You know that S2 ⊆ SNP∩coNP2 ⊆ ZPPNP and SNP2 ⊆ ZPPNPNP, but believe that some of those "⊆"s are "=" s or are (gasp!) provably strict containments (thus giving some insight into whether recent improvements (Cai in FOCS 2001; Cai et al. in Information and Computation 2005) in the collapses of the polynomial hierarchy from assumptions that NP is in P/poly, (NP ∩ coNP)/poly, or coNP/poly are strict improvements)? Well, prove an "=" or find evidence for a strict containment... or to really make this a summer for us all to remember, prove a strict containment! Wishing you happy theorems.This article gives an overview of recent PCP constructions based on the Long Code and the inapproximability results implied by these constructions. We cover the inapproximability results for (1) MAX-3SAT and CLIQUE (2) Results for SPARSEST CUT, VERTEX COVER and MAX-CUT implied by the Unique Games Conjecture and (3) HYPERGRAPH VERTEX COVER and coloring problems on hypergraphs. The article aims at explaining the general framework that, loosely speaking, incorporates all the above results.
- M. Andrews and L. Zhang. Hardness of the undirected edge-disjoint paths problem. In Proc. 37th ACM Symposium on Theory of Computing, 2005. Google Scholar
Digital Library
- M. Andrews and L. Zhang. Hardness of the undirected congestion minimization problem. In Proc. 37th ACM Symposium on Theory of Computing, 2005. Google ScholarDigital Library
- S. Arora. Probabilistic checking of proofs and the hardness of approximation problems. Ph.D. thesis, UC Berkeley, 1991. Google ScholarDigital Library
- S. Arora and C. Lund. The approximability of NP-hard problems. Chapter in Approximation Algorithms for NP-hard Problems, D. Hochbaum ed., PWS Publishing, Boston, 1996.Google Scholar
- S. Arora, L. Babai, J. Stern, and E. Z. Sweedyk. The hardness of approximate optima in lattices, codes and systems of linear equations. Journal of Computer and Systems Sciences (54), pp 317--331, 1997. Google ScholarDigital Library
- S. Arora, C. Lund, R. Motawani, M. Sudan, and M. Szegedy. Proof verification and the hardness of approximation problems. Journal of the ACM, 45(3), pp 501--555, 1998. Google ScholarDigital Library
- S. Arora and S. Safra. Probabilistic checking of proofs: A new characterization of NP. Journal of the ACM, 45(1), pp 70--122, 1998. Google ScholarDigital Library
- M. Bellare, O. Goldreich, and M. Sudan. Free bits, PCPs, and nonapproximability-towards tight results. SIAM Journal of Computing, 27(3), pp 804--915, 1998. Google ScholarDigital Library
- J. Bourgain. On the distribution of the Fourier speactrum of boolean functions. Israel J. of Math.: (131), pp 269--276, 2002.Google ScholarCross Ref
- S. Chawla, R. Krauthgamer, R. Kumar, Y. Rabani, and D. Sivakumar. On the hardness of approximating Multicut and Sparsest Cut. In Proc. 20th IEEE Conference on Computational Complexity, 2005. Google ScholarDigital Library
- J. Chuzhoy and S. Naor. New hardness results for congestion minimization and machine scheduling. In Proc. 36th ACM symposium on Theory of computing, pp 28--34, 2004. Google ScholarDigital Library
- I. Dinur, V. Guruswami, S. Khot, and O. Regev. A new multilayered PCP and the hardness of hypergraph vertex cover. In Proc. 35th ACM Symposium on Theory of Computing, pp 595--601, 2003. Google ScholarDigital Library
- I. Dinur, O. Regev, and C. Smyth. The hardness of 3-uniform hypergraph coloring. In Proc. 43rd IEEE Symposium on Foundations of Computer Science, 2002. Google ScholarDigital Library
- I. Dinur and S. Safra. On the importance of being biased. In Proc. 34th ACM Symposium on Theory of Computing, pp 33--42, 2002. Google ScholarDigital Library
- U. Feige. A threshold of ln n for approximating set cover. Journal of the ACM, 45(4), pp 634--652, 1998. Google ScholarDigital Library
- U. Feige. Relations between average case complexity and approximation complexity. In Proc. 34th ACM Symposium on Theory of Computing, pp 534--543, 2002. Google ScholarDigital Library
- U. Feige, S. Goldwasser, L. Lovász, S. Safra, and M. Szegedy. Interactive proofs and the hardness of approximating cliques. Journal of the ACM, 43(2), pp 268--292, 1996. Google ScholarDigital Library
- U. Feige and D. Reichman. On systems of linear equations with two variables per equation. APPROXRANDOM, pp 117--127, 2004.Google ScholarCross Ref
- E. Friedgut. Boolean functions with low average sensitivity depend on few coordinates. Combinatorica, 18(1), pp 27--35, 1998.Google ScholarCross Ref
- M. Goemans and D. Williamson. Improved approximation algorithms for Maximum Cut and Satisfiability problems using semidefinite programming. Journal of the ACM, 42, pp 1115--1145, 1995. Google ScholarDigital Library
- V. Guruswami, J. Håstad, and M. Sudan. Hardness of approximate hypergraph coloring. SIAM Journal of Computing, 31(6), pp 1663--1686, 2002. Google ScholarDigital Library
- V. Guruswami and S. Khot. Hardness of Max 3SAT with no mixed clauses. In Proc. 20th IEEE Conference on Computational Complexity, 2005. Google ScholarDigital Library
- J. Hastad. Clique is hard to approximate within n1--ε. Acta Mathematica, Vol 182, pp 105--142, 1999.Google ScholarCross Ref
- J. Hastad. Some optimal inapproximability results. Journal of the ACM, Vol. 48, pp 798--859, 2001. Google ScholarDigital Library
- J. Hastad and A. Wigderson. Simple analysis of graph tests for linearity and PCP. Random Structures and Algorithms, Vol 22, no. 2, pp 139--160, 2003. Google ScholarDigital Library
- J. Holmerin. Vertex cover on 4-regular hyper-graphs is hard to approximate within 2-ε. In Proc. 34th ACM Symposium on Theory of Computing, pp 544--552, 2002. Google ScholarDigital Library
- J. Kahn, G. Kalai, and N. Linial. The influence of variables on boolean functions. In Proc. 29th IEEE Symposium on Foundations of Computer Science, pp 68--80, 1988.Google ScholarDigital Library
- S. Khot. Ph.D. Thesis. Dept. of Computer Science, Princeton University, Tech. Report TR-673-03, 2003.Google Scholar
- S. Khot. On the power of unique 2-prover 1-round games. In Proc. 34th ACM Symposium on Theory of Computing, pp. 767--775, 2002. Google ScholarDigital Library
- S. Khot. Ruling out PTAS for graph min-bisection, densest subgraph and bipartite clique. In Proc. 45th IEEE Symposium on Foundations of Computer Science, 2004. Google ScholarDigital Library
- S. Khot. Hardness results for coloring 3-colorable 3-uniform hypergraphs. In Proc. 43rd IEEE Symposium on Foundations of Computer Science, pp 23--32, 2002. Google ScholarDigital Library
- S. Khot. Hardness of approximating the shortest vector problem in lattices. In Proc. 45th IEEE Symposium on Foundations of Computer Science, pp 126--135, 2004. Google ScholarDigital Library
- S. Khot, G. Kindler, E. Mossel, and R. O'Donnell. Optimal inapproximability results for Max-Cut and other 2-variable CSPs? In Proc. 45th IEEE Symposium on Foundations of Computer Science, pp 146--154, 2004. Google ScholarDigital Library
- S. Khot and O. Regev. Vertex cover might be hard to approximate to within 2 -- ε. In Proc. 18th IEEE Conference on Computational Complexity, pp 379--386, 2003.Google ScholarCross Ref
- S. Khot and N. Vishnoi. The unique games conjecture, integrality gap for cut problems and embeddability of negative type metrics into l1. Preprint, 2005.Google Scholar
- E. Mossel, R. O'Donnell, and K. Oleszkiewicz. Noise stability of functions with low influences: invariance and optimality. Preprint, 2005.Google Scholar
- R. Raz. A parallel repetition theorem. SIAM Journal on Computing, 27(3), pp 763--803, 1998. Google ScholarDigital Library
- L. Russo. An approximate zero-one law. Z. Wahrsch. Verw. Gebiete, 61(1), pp 129--139, 1982.Google ScholarCross Ref
- A. Samorodnitsky and L. Trevisan. A PCP characterization of NP with optimal amortized query complexity. In Proc. 32nd ACM Symposium on Theory of Computing, pp 191--199, 2000. Google ScholarDigital Library
- L. Trevisan. Inapproximability of combinatorial optimization problems. Survey paper, 2004.Google Scholar
- L. Trevisan. Approximation algorithms for unique games. Preprint, 2005.Google ScholarDigital Library
- V. Vazirani. Approximation Algorithms. Springer-Verlag, Berlin, 2001. Google ScholarDigital Library
Index Terms
- Guest column: inapproximability results via Long Code based PCPs
Recommendations
Free Bits, PCPs, and Nonapproximability---Towards Tight Results
This paper continues the investigation of the connection between probabilistically checkable proofs (PCPs) and the approximability of NP -optimization problems. The emphasis is on proving tight nonapproximability results via consideration of measures ...
Reductions, codes, PCPs, and inapproximability
FOCS '95: Proceedings of the 36th Annual Symposium on Foundations of Computer ScienceMany recent results show the hardness of approximating NP-hard functions. We formalize, in a very simple way, what these results involve: a code-like Levin reduction. Assuming a well-known complexity assumption, we show that such reductions cannot prove ...
Combinatorial PCPs with Efficient Verifiers
The PCP theorem asserts the existence of proofs that can be verified by a verifier that reads only a very small part of the proof. The theorem was originally proved by Arora and Safra (J. ACM 45(1)) and Arora et al. (J. ACM 45(3)) using sophisticated ...
Comments