Advertisement

The Time Complexity of Constraint Satisfaction

  • Patrick Traxler
Part of the Lecture Notes in Computer Science book series (LNCS, volume 5018)

Abstract

We study the time complexity of (d,k)-CSP, the problem of deciding satisfiability of a constraint system Open image in new window with n variables, domain size d, and at most k variables per constraint. We are interested in the question how the domain size d influences the complexity of deciding satisfiability. We show, assuming the Exponential Time Hypothesis, that two special cases, namely (d,2)-CSP with bounded variable frequency and d-UNIQUE-CSP, already require exponential time Ω(d c·n ) for some c > 0 independent of d. UNIQUE-CSP is the special case for which it is guaranteed that every input constraint system has at most 1 satisfying assignment.

Preview

Unable to display preview. Download preview PDF.

Unable to display preview. Download preview PDF.

References

  1. 1.
    Björklund, A., Husfeldt, T.: Inclusion–exclusion algorithms for counting set partitions. In: Proc. of the 47th Annual IEEE Symposium on Foundations of Computer Science, pp. 575–582 (2006)Google Scholar
  2. 2.
    Calabro, C., Impagliazzo, R., Kabanets, V., Paturi, R.: The complexity of unique k-SAT: An isolation lemma for k-CNFs. In: Proc. of the 18th Annual IEEE Conference on Computational Complexity, pp. 135–141 (2003)Google Scholar
  3. 3.
    Eppstein, D.: Improved algorithms for 3-coloring, 3-edge-coloring, and constraint satisfaction. In: Proc. of the 12th Annual ACM-SIAM Symposium on Discrete Algorithms, pp. 329–337 (2001)Google Scholar
  4. 4.
    Feder, T., Motwani, R.: Worst-case time bounds for coloring and satisfiability problems. J. Algorithms 45(2), 192–201 (2002)zbMATHCrossRefMathSciNetGoogle Scholar
  5. 5.
    Haxell, P.E.: A condition for matchability in hypergraphs. Graphs and Combinatorics 11, 245–248 (1995)zbMATHCrossRefMathSciNetGoogle Scholar
  6. 6.
    Impagliazzo, R., Paturi, R.: On the complexity of k-SAT. J. Computer and System Sciences 62(2), 367–375 (2001)zbMATHCrossRefMathSciNetGoogle Scholar
  7. 7.
    Impagliazzo, R., Paturi, R., Zane, F.: Which problems have strongly exponential complexity? J. Computer and System Sciences 63(4), 512–530 (2001)zbMATHCrossRefMathSciNetGoogle Scholar
  8. 8.
    Iwama, K., Tamaki, S.: Improved upper bounds for 3-SAT. In: Proc. of the 15th Annual ACM-SIAM Symposium on Discrete Algorithms, pp. 328–329 (2004)Google Scholar
  9. 9.
    Johnson, D.S., Szegedy, M.: What are the least tractable instances of max independent set? In: Proc. of the 10th Annual ACM-SIAM Symposium on Discrete Algorithms, pp. 927–928 (1999)Google Scholar
  10. 10.
    Koivisto, M.: An O(2n) algorithm for graph coloring and other partitioning problems via inclusion–exclusion. In: Proc. of the 47th Annual IEEE Symposium on Foundations of Computer Science, pp. 583–590 (2006)Google Scholar
  11. 11.
    Mulmuley, K., Vazirani, U.V., Vazirani, V.V.: Matching is as easy as matrix inversion. Combinatorica 7(1), 105–113 (1987)zbMATHCrossRefMathSciNetGoogle Scholar
  12. 12.
    Schöning, U.: A probabilistic algorithm for k-SAT and constraint satisfaction problems. In: Proc. of the 40th Annual Symposium on Foundations of Computer Science, pp. 410–414 (1999)Google Scholar
  13. 13.
    Scott, A.D., Sorkin, G.B.: An LP-designed algorithm for constraint satisfaction. In: Proc. of the 14th Annual European Symposium on Algorithms, pp. 588–599 (2006)Google Scholar
  14. 14.
    Valiant, L.G., Vazirani, V.V.: NP is as easy as detecting unique solutions. Theoretical Computer Science 47(1), 85–93 (1986)zbMATHCrossRefMathSciNetGoogle Scholar
  15. 15.
    Williams, R.: A new algorithm for optimal 2-constraint satisfaction and its implications. Theoretical Computer Science 348(2–3), 357–365 (2005)zbMATHCrossRefMathSciNetGoogle Scholar

Copyright information

© Springer-Verlag Berlin Heidelberg 2008

Authors and Affiliations

  • Patrick Traxler
    • 1
  1. 1.Institute of Theoretical Computer ScienceETH ZürichSwitzerland

Personalised recommendations