skip to main content
research-article

Optimal Sparsification for Some Binary CSPs Using Low-Degree Polynomials

Published:31 August 2019Publication History
Skip Abstract Section

Abstract

This article analyzes to what extent it is possible to efficiently reduce the number of clauses in NP-hard satisfiability problems without changing the answer. Upper and lower bounds are established using the concept of kernelization. Existing results show that if NP ⊈ coNP/poly, no efficient preprocessing algorithm can reduce n-variable instances of cnf-sat with d literals per clause to equivalent instances with  O(nd−ε ) bits for any ε > 0. For the Not-All-Equal sat problem, a compression to size Õ(nd−1) exists. We put these results in a common framework by analyzing the compressibility of CSPs with a binary domain. We characterize constraint types based on the minimum degree of multivariate polynomials whose roots correspond to the satisfying assignments, obtaining (nearly) matching upper and lower bounds in several settings. Our lower bounds show that not just the number of constraints, but also the encoding size of individual constraints plays an important role. For example, for Exact Satisfiability with unbounded clause length it is possible to efficiently reduce the number of constraints to  n+1, yet no polynomial-time algorithm can reduce to an equivalent instance with  O(n2−ε ) bits for any  ε > 0, unless NP ⊆ coNP/poly.

References

  1. David A. Mix Barrington. 1992. Some problems involving Razborov-Smolensky polynomials. In Proceedings of the London Mathematical Society Symposium on Boolean Function Complexity. Cambridge University Press, 109--128. Google ScholarGoogle ScholarDigital LibraryDigital Library
  2. David A. Mix Barrington, Richard Beigel, and Steven Rudich. 1994. Representing Boolean functions as polynomials modulo composite numbers. Comput. Complex. 4, 4 (1994), 367--382. Google ScholarGoogle ScholarDigital LibraryDigital Library
  3. Richard Beigel. 1993. The polynomial method in circuit complexity. In Proceedings of the 8th CCC. 82--95.Google ScholarGoogle ScholarCross RefCross Ref
  4. Abhishek Bhowmick and Shachar Lovett. 2015. Nonclassical polynomials as a barrier to polynomial lower bounds. In Proceedings of the 30th CCC (LIPIcs), Vol. 33. 72--87. Google ScholarGoogle ScholarDigital LibraryDigital Library
  5. Hans L. Bodlaender. 2015. Kernelization, exponential lower bounds. In Encyclopedia of Algorithms. Springer.Google ScholarGoogle Scholar
  6. Hans L. Bodlaender, Bart M. P. Jansen, and Stefan Kratsch. 2014. Kernelization lower bounds by cross-composition. SIAM J. Discrete Math. 28, 1 (2014), 277--305.Google ScholarGoogle ScholarDigital LibraryDigital Library
  7. Hans L. Bodlaender, Stéphan Thomassé, and Anders Yeo. 2011. Kernel bounds for disjoint cycles and disjoint paths. Theor. Comput. Sci. 412, 35 (2011), 4570--4578. Google ScholarGoogle ScholarDigital LibraryDigital Library
  8. Andrei A. Bulatov and Dániel Marx. 2014. Constraint satisfaction parameterized by solution size. SIAM J. Comput. 43, 2 (2014), 573--616.Google ScholarGoogle ScholarCross RefCross Ref
  9. Hubie Chen, Bart M. P. Jansen, and Astrid Pieterse. 2019. Best-case and worst-case sparsifiability of Boolean CSPs. In Proceedings of the 13th IPEC Vol. 115. 15:1--15:13.Google ScholarGoogle Scholar
  10. Marek Cygan, Fedor V. Fomin, Lukasz Kowalik, Daniel Lokshtanov, Dániel Marx, Marcin Pilipczuk, Michal Pilipczuk, and Saket Saurabh. 2015. Parameterized Algorithms. Springer. Google ScholarGoogle ScholarDigital LibraryDigital Library
  11. Holger Dell, Eun Jung Kim, Michael Lampis, Valia Mitsou, and Tobias Mömke. 2015. Complexity and approximability of parameterized MAX-CSPs. In Proceedings of the 10th IPEC (LIPIcs), Vol. 43. 294--306.Google ScholarGoogle Scholar
  12. Holger Dell and Dániel Marx. 2012. Kernelization of packing problems. In Proceedings of the 23rd SODA. 68--81. Google ScholarGoogle ScholarDigital LibraryDigital Library
  13. Holger Dell and Dieter van Melkebeek. 2014. Satisfiability allows no nontrivial sparsification unless the polynomial-time hierarchy collapses. J. ACM 61, 4 (2014), 23:1--23:27. Google ScholarGoogle ScholarDigital LibraryDigital Library
  14. Michael Dom, Daniel Lokshtanov, and Saket Saurabh. 2009. Incompressibility through colors and IDs. In Proceedings of the 36th ICALP. 378--389. Google ScholarGoogle ScholarDigital LibraryDigital Library
  15. Michael Dom, Daniel Lokshtanov, and Saket Saurabh. 2014. Kernelization lower bounds through colors and IDs. ACM Trans. Algor. 11, 2 (2014), 13. Google ScholarGoogle ScholarDigital LibraryDigital Library
  16. Rodney G. Downey and Michael R. Fellows. 2013. Fundamentals of Parameterized Complexity. Springer. 1--769 pages. Google ScholarGoogle ScholarDigital LibraryDigital Library
  17. J. Flum and M. Grohe. 2006. Parameterized Complexity Theory. Springer-Verlag. Google ScholarGoogle ScholarDigital LibraryDigital Library
  18. Lance Fortnow and Rahul Santhanam. 2011. Infeasibility of instance compression and succinct PCPs for NP. J. Comput. Syst. Sci. 77, 1 (2011), 91--106. Google ScholarGoogle ScholarDigital LibraryDigital Library
  19. Ben Green and Terence Tao. 2008. The primes contain arbitrarily long arithmetic progressions. Ann. Math. 167, 2 (2008), 481--547.Google ScholarGoogle ScholarCross RefCross Ref
  20. Gregory Gutin. 2015. Kernelization: Constraint satisfaction problems parameterized above average. In Encyclopedia of Algorithms, Ming-Yang Kao (Ed.). Springer.Google ScholarGoogle Scholar
  21. Leslie Hogben. 2014. Handbook of Linear Algebra, Second Edition. Chapman and Hall/CRC.Google ScholarGoogle Scholar
  22. John A. Howell. 1986. Spans in the module (Z<sub>m</sub>)<sup>s</sup> . Linear Multilin. Alg. 19, 1 (1986), 67--77.Google ScholarGoogle ScholarCross RefCross Ref
  23. Russell Impagliazzo, Ramamohan Paturi, and Francis Zane. 2001. Which problems have strongly exponential complexity? J. Comput. Syst. Sci. 63, 4 (2001), 512--530. Google ScholarGoogle ScholarDigital LibraryDigital Library
  24. Bart M. P. Jansen. 2015. On sparsification for computing treewidth. Algorithmica 71, 3 (2015), 605--635. Google ScholarGoogle ScholarDigital LibraryDigital Library
  25. Bart M. P. Jansen. 2016. Constrained bipartite vertex cover: The easy kernel is essentially tight. In Proceedings of the 33rd STACS (LIPIcs), Vol. 47. 45:1--45:13.Google ScholarGoogle Scholar
  26. Bart M. P. Jansen and Astrid Pieterse. 2017. Sparsification upper and lower bounds for graph problems and not-all-equal SAT. Algorithmica 79, 1 (2017), 3--28. Google ScholarGoogle ScholarDigital LibraryDigital Library
  27. Bart M. P. Jansen and Astrid Pieterse. 2018. Optimal data reduction for graph coloring using low-degree polynomials. In Proceedings of the 12th IPEC (2017), Vol. 89. 22:1--22:12.Google ScholarGoogle Scholar
  28. R. M. Karp. 1972. Reducibility among combinatorial problems. In Complexity of Computer Computations. Plenum Press, 85--103.Google ScholarGoogle Scholar
  29. Stefan Kratsch. 2014. Recent developments in kernelization: A survey. Bull. EATCS 113 (2014), 58--97.Google ScholarGoogle Scholar
  30. Stefan Kratsch, Dániel Marx, and Magnus Wahlström. 2016. Parameterized complexity and kernelizability of max ones and exact ones problems. ACM Trans. Comput. Theory 8, 1 (2016), 1. Google ScholarGoogle ScholarDigital LibraryDigital Library
  31. Stefan Kratsch and Magnus Wahlström. 2010. Preprocessing of min ones problems: A dichotomy. In Proceedings of the 37th ICALP (Lecture Notes in Computer Science), Vol. 6198. 653--665. Google ScholarGoogle ScholarDigital LibraryDigital Library
  32. Victor Lagerkvist and Magnus Wahlström. 2017. Kernelization of constraint satisfaction problems: A study through universal algebra. In Proceedings of the 23rd CP. 157--171.Google ScholarGoogle ScholarCross RefCross Ref
  33. Daniel Lokshtanov, Neeldhara Misra, and Saket Saurabh. 2012. Kernelization—Preprocessing with a guarantee. In The Multivariate Algorithmic Revolution and Beyond—Essays Dedicated to Michael R. Fellows on the Occasion of His 60th Birthday (Lecture Notes in Computer Science), Vol. 7370. 129--161. Google ScholarGoogle ScholarDigital LibraryDigital Library
  34. Lásló Lovász. 1976. Chromatic number of hypergraphs and linear algebra. In Studia Scientiarum Mathematicarum Hungarica 11. 113--114. Retrieved from: http://real-j.mtak.hu/5461/.Google ScholarGoogle Scholar
  35. Rahul Santhanam and Srikanth Srinivasan. 2012. On the limits of sparsification. In Proceedings of the 39th ICALP. 774--785. Google ScholarGoogle ScholarDigital LibraryDigital Library
  36. Thomas J. Schaefer. 1978. The complexity of satisfiability problems. In Proceedings of the 10th ACM Symposium on Theory of Computing. 216--226. Google ScholarGoogle ScholarDigital LibraryDigital Library
  37. Arne Storjohann and Thom Mulders. 1998. Fast Algorithms for Linear Algebra Modulo N. Springer Berlin, 139--150. Google ScholarGoogle ScholarDigital LibraryDigital Library
  38. Gábor Tardos and David A. Mix Barrington. 1998. A lower bound on the mod 6 degree of the OR function. Comput. Complex. 7, 2 (1998), 99--108. Google ScholarGoogle ScholarDigital LibraryDigital Library

Index Terms

  1. Optimal Sparsification for Some Binary CSPs Using Low-Degree Polynomials

      Recommendations

      Comments

      Login options

      Check if you have access through your login credentials or your institution to get full access on this article.

      Sign in

      Full Access

      PDF Format

      View or Download as a PDF file.

      PDF

      eReader

      View online with eReader.

      eReader

      HTML Format

      View this article in HTML Format .

      View HTML Format
      About Cookies On This Site

      We use cookies to ensure that we give you the best experience on our website.

      Learn more

      Got it!