Document Open Access Logo

A Birthday Repetition Theorem and Complexity of Approximating Dense CSPs

Authors Pasin Manurangsi, Prasad Raghavendra

PDF
Thumbnail PDF

File

LIPIcs.ICALP.2017.78.pdf
  • Filesize: 0.59 MB
  • 15 pages

Document Identifiers

Author Details

Pasin Manurangsi
Prasad Raghavendra

Cite As Get BibTex

Pasin Manurangsi and Prasad Raghavendra. A Birthday Repetition Theorem and Complexity of Approximating Dense CSPs. In 44th International Colloquium on Automata, Languages, and Programming (ICALP 2017). Leibniz International Proceedings in Informatics (LIPIcs), Volume 80, pp. 78:1-78:15, Schloss Dagstuhl – Leibniz-Zentrum für Informatik (2017) https://doi.org/10.4230/LIPIcs.ICALP.2017.78

Abstract

A (k x l)-birthday repetition G^{k x l} of a two-prover game G is a game in which the two provers are sent random sets of questions from G of sizes k and l respectively. These two sets are sampled independently uniformly among all sets of questions of those particular sizes. We prove the following birthday repetition theorem: when G satisfies some mild conditions, val(G^{k x l}) decreases exponentially in Omega(kl/n) where n is the total number of questions. Our result positively resolves an open question posted by Aaronson, Impagliazzo and Moshkovitz [Aaronson et al., CCC, 2014].

As an application of our birthday repetition theorem, we obtain new fine-grained inapproximability results for dense CSPs. Specifically, we establish a tight trade-off between running time and approximation ratio by showing conditional lower bounds, integrality gaps and approximation algorithms; in particular, for any sufficiently large i and for every k >= 2, we show the following:
- We exhibit an O(q^{1/i})-approximation algorithm for dense Max k-CSPs with alphabet size q via O_k(i)-level of Sherali-Adams relaxation.
- Through our birthday repetition theorem, we obtain an integrality gap of q^{1/i} for Omega_k(i / polylog i)-level Lasserre relaxation for fully-dense Max k-CSP.
- Assuming that there is a constant epsilon > 0 such that Max 3SAT cannot be approximated to within (1 - epsilon) of the optimal in sub-exponential time, our birthday repetition theorem implies that any algorithm that approximates fully-dense Max k-CSP to within a q^{1/i} factor takes (nq)^{Omega_k(i / polylog i)} time, almost tightly matching our algorithmic result.

As a corollary of our algorithm for dense Max k-CSP, we give a new approximation algorithm for Densest k-Subhypergraph, a generalization of Densest k-Subgraph to hypergraphs. When the input hypergraph is O(1)-uniform and the optimal k-subhypergraph has constant density, our algorithm finds a k-subhypergraph of density Omega(n^{−1/i}) in time n^{O(i)} for any integer i > 0.

Subject Classification

Keywords
  • Birthday Repetition
  • Constraint Satisfaction Problems
  • Linear Program

Metrics

  • Access Statistics
  • Total Accesses (updated on a weekly basis)
    0
    PDF Downloads
    0
    Metadata Views

References

  1. Scott Aaronson, Salman Beigi, Andrew Drucker, Bill Fefferman, and Peter W. Shor. The power of unentanglement. Theory of Computing, 5(1):1-42, 2009. Google Scholar
  2. Scott Aaronson, Russell Impagliazzo, and Dana Moshkovitz. AM with multiple Merlins. In IEEE CCC, pages 44-55, June 2014. Google Scholar
  3. Noga Alon, Wenceslas Fernandez de la Vega, Ravi Kannan, and Marek Karpinski. Random sampling and approximation of MAX-CSPs. J. Comput. Syst. Sci., 67(2):212-243, September 2003. Google Scholar
  4. Benny Applebaum. Pseudorandom generators with long stretch and low locality from random local one-way functions. SIAM J. Comput., 42(5):2008-2037, 2013. Google Scholar
  5. Sanjeev Arora, David Karger, and Marek Karpinski. Polynomial time approximation schemes for dense instances of NP-hard problems. In ACM STOC, pages 284-293, 1995. Google Scholar
  6. Sanjeev Arora, Carsten Lund, Rajeev Motwani, Madhu Sudan, and Mario Szegedy. Proof verification and the hardness of approximation problems. J. ACM, 45(3):501-555, May 1998. Google Scholar
  7. Sanjeev Arora and Madhu Sudan. Improved low-degree testing and its applications. Combinatorica, 23(3):365-426, 2003. Google Scholar
  8. Yakov Babichenko, Christos H. Papadimitriou, and Aviad Rubinstein. Can almost everybody be almost happy? In ACM ITCS, pages 1-9, 2016. Google Scholar
  9. Boaz Barak, Fernando G. S. L. Brandao, Aram W. Harrow, Jonathan Kelner, David Steurer, and Yuan Zhou. Hypercontractivity, sum-of-squares proofs, and their applications. In ACM STOC, pages 307-326, 2012. Google Scholar
  10. Boaz Barak, Moritz Hardt, Thomas Holenstein, and David Steurer. Subsampling mathematical relaxations and average-case complexity. In ACM-SIAM SODA, pages 512-531, 2011. Google Scholar
  11. Boaz Barak, Prasad Raghavendra, and David Steurer. Rounding semidefinite programming hierarchies via global correlation. In IEEE FOCS, pages 472-481, 2011. Google Scholar
  12. Mihir Bellare, Shafi Goldwasser, Carsten Lund, and Alexander Russell. Efficient probabilistically checkable proofs and applications to approximations. In ACM STOC, pages 294-304, 1993. Google Scholar
  13. Aditya Bhaskara, Moses Charikar, Eden Chlamtác, Uriel Feige, and Aravindan Vijayaraghavan. Detecting high log-densities: An O(n^1/4) approximation for densest k-subgraph. In ACM STOC, pages 201-210, 2010. Google Scholar
  14. Mark Braverman and Ankit Garg. Small value parallel repetition for general games. In ACM STOC, pages 335-340, 2015. Google Scholar
  15. Mark Braverman, Young Kun Ko, Aviad Rubinstein, and Omri Weinstein. ETH hardness for densest-k-subgraph with perfect completeness. In ACM-SIAM SODA, pages 1326-1341, 2017. Google Scholar
  16. Mark Braverman, Young Kun Ko, and Omri Weinstein. Approximating the best Nash equilibrium in n^o(log n)-time breaks the exponential time hypothesis. In ACM-SIAM SODA, pages 970-982, 2015. Google Scholar
  17. Moses Charikar, MohammadTaghi Hajiaghayi, and Howard Karloff. Improved approximation algorithms for label cover problems. Algorithmica, 61(1):190-206, 2011. Google Scholar
  18. Eden Chlamtác, Michael Dinitz, Christian Konrad, Guy Kortsarz, and George Rabanca. The densest k-subhypergraph problem. In APPROX, pages 6:1-6:19, 2016. Google Scholar
  19. Eden Chlamtác, Pasin Manurangsi, Dana Moshkovitz, and Aravindan Vijayaraghavan. Approximation algorithms for label cover and the log-density threshold. In ACM-SIAM SODA, pages 900-919, 2017. Google Scholar
  20. Amin Coja-Oghlan, Colin Cooper, and Alan Frieze. An efficient sparse regularity concept. SIAM J. Discret. Math., 23(4):2000-2034, 2010. Google Scholar
  21. Wenceslas Fernandez de la Vega, Marek Karpinski, Ravi Kannan, and Santosh Vempala. Tensor decomposition and approximation schemes for constraint satisfaction problems. In ACM STOC, pages 747-754, 2005. Google Scholar
  22. Wenceslas Fernandez de la Vega and Claire Kenyon-Mathieu. Linear programming relaxations of Maxcut. In ACM-SIAM SODA, pages 53-61, 2007. Google Scholar
  23. Irit Dinur. Mildly exponential reduction from gap 3SAT to polynomial-gap label-cover. ECCC, 23:128, 2016. Google Scholar
  24. Irit Dinur, Eldar Fischer, Guy Kindler, Ran Raz, and Shmuel Safra. PCP characterizations of NP: Toward a polynomially-small error-probability. Computational Complexity, 20(3):413-504, 2011. Google Scholar
  25. Irit Dinur and David Steurer. Analytical approach to parallel repetition. In ACM STOC, pages 624-633, 2014. Google Scholar
  26. Shaddin Dughmi. On the hardness of signaling. In IEEE FOCS, pages 354-363, 2014. Google Scholar
  27. Uriel Feige, David Peleg, and Guy Kortsarz. The dense k-subgraph problem. Algorithmica, 29(3), 2001. Google Scholar
  28. Uriel Feige and Michael Seltser. On the densest k-subgraph problems, 1997. Google Scholar
  29. Dimitris Fotakis, Michael Lampis, and Vangelis Th. Paschos. Sub-exponential approximation schemes for CSPs: From dense to almost sparse. In STACS, pages 37:1-37:14, 2016. Google Scholar
  30. Alan M. Frieze and Ravi Kannan. The regularity lemma and approximation schemes for dense problems. In FOCS, pages 12-20, 1996. Google Scholar
  31. Venkatesan Guruswami and Ali Kemal Sinop. Lasserre hierarchy, higher eigenvalues, and approximation schemes for graph partitioning and quadratic integer programming with PSD objectives. In IEEE FOCS, pages 482-491, 2011. Google Scholar
  32. Mohammad Taghi Hajiaghayi, Kamal Jain, Kishori M. Konwar, Lap Chi Lau, Ion I. Măndoiu, Alexander Russell, Alexander A. Shvartsman, and Vijay V. Vazirani. The minimum k-colored subgraph problem in haplotyping and DNA primer selection. In IWBRA, 2006. Google Scholar
  33. Aram W. Harrow and Ashley Montanaro. Testing product states, quantum Merlin-Arthur games and tensor optimization. J. ACM, 60(1):3:1-3:43, February 2013. Google Scholar
  34. Thomas Holenstein. Parallel repetition: Simplification and the no-signaling case. Theory of Computing, 5(1):141-172, 2009. Google Scholar
  35. Russel Impagliazzo and Ramamohan Paturi. On the complexity of k-sat. J. Comput. Syst. Sci., 62(2):367-375, March 2001. Google Scholar
  36. Guy Kortsarz and David Peleg. On choosing a dense subgraph. In IEEE SFCS, pages 692-701, 1993. Google Scholar
  37. Jean B. Lasserre. Global optimization with polynomials and the problem of moments. SIAM J. on Optimization, 11(3):796-817, March 2000. Google Scholar
  38. Richard J. Lipton, Evangelos Markakis, and Aranyak Mehta. Playing large games using simple strategies. In ACM EC, pages 36-41, 2003. Google Scholar
  39. Pasin Manurangsi. Almost-polynomial ratio ETH-hardness of approximating densest k-subgraph. In ACM STOC, 2017. To appear. Google Scholar
  40. Pasin Manurangsi and Dana Moshkovitz. Approximating dense Max 2-CSPs. In APPROX, pages 396-415, 2015. Google Scholar
  41. Pasin Manurangsi and Dana Moshkovitz. Improved approximation algorithms for projection games. Algorithmica, pages 1-40, 2015. Google Scholar
  42. Pasin Manurangsi and Prasad Raghavendra. A birthday repetition theorem and complexity of approximating dense CSPs. CoRR, abs/1607.02986, 2016. URL: https://arxiv.org/abs/1607.02986.
  43. Pasin Manurangsi and Aviad Rubinstein. Inapproximability of VC Dimension and Littlestone’s Dimension. Unpublished manuscript, 2017. Google Scholar
  44. Claire Mathieu and Warren Schudy. Yet another algorithm for dense max cut: go greedy. In ACM-SIAM SODA, pages 176-182, 2008. Google Scholar
  45. Dana Moshkovitz. The projection games conjecture and the NP-hardness of ln n-approximating set-cover. In APPROX 2012, pages 276-287, 2012. Google Scholar
  46. Dana Moshkovitz. Parallel repetition from fortification. In IEEE FOCS, pages 414-423, 2014. Google Scholar
  47. Dana Moshkovitz and Ran Raz. Two-query PCP with subconstant error. J. ACM, 57(5):29:1-29:29, June 2008. Google Scholar
  48. David Peleg. Approximation algorithms for the label-cover max and red-blue set cover problems. Journal of Discrete Algorithms, 5(1):55-64, 2007. Google Scholar
  49. Prasad Raghavendra and Ning Tan. Approximating CSPs with global cardinality constraints using SDP hierarchies. In ACM-SIAM SODA, pages 373-387, 2012. Google Scholar
  50. Anup Rao. Parallel repetition in projection games and a concentration bound. SIAM J. Comput., 40(6):1871-1891, 2011. Google Scholar
  51. Ran Raz. A parallel repetition theorem. SIAM J. Comput., 27(3):763-803, 1998. Google Scholar
  52. Ran Raz and Shmuel Safra. A sub-constant error-probability low-degree test, and a sub-constant error-probability PCP characterization of NP. In ACM STOC, pages 475-484, 1997. Google Scholar
  53. Aviad Rubinstein. ETH-hardness for signaling in symmetric zero-sum games. CoRR, abs/1510.04991, 2015. Google Scholar
  54. Aviad Rubinstein. Settling the complexity of computing approximate two-player Nash equilibria. In IEEE FOCS, pages 258-265, 2016. Google Scholar
  55. Grant Schoenebeck. Linear level lasserre lower bounds for certain k-CSPs. In IEEE FOCS, pages 593-602, 2008. Google Scholar
  56. Hanif D. Sherali and Warren P. Adams. A hierarchy of relaxation between the continuous and convex hull representations. SIAM J. Discret. Math., 3(3):411-430, May 1990. Google Scholar
  57. Akiko Suzuki and Takeshi Tokuyama. Dense subgraph problems with output-density conditions. ACM Trans. Algorithms, 4(4):43:1-43:18, August 2008. Google Scholar
  58. Grigory Yaroslavtsev. Going for speed: Sublinear algorithms for dense r-CSPs. CoRR, abs/1407.7887, 2014. Google Scholar
  59. Grigory Yaroslavtsev. Personal communication, March 2016. Google Scholar
  60. Yuichi Yoshida and Yuan Zhou. Approximation schemes via Sherali-Adams hierarchy for dense constraint satisfaction problems and assignment problems. In ITCS 2014, pages 423-438, 2014. Google Scholar
Questions / Remarks / Feedback
X

Feedback for Dagstuhl Publishing


Thanks for your feedback!

Feedback submitted

Could not send message

Please try again later or send an E-mail
© 2023-2024 Schloss Dagstuhl – LZI GmbH About DROPS Imprint Privacy Contact