The time complexity of constraint satisfaction

Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)

Volumn 5018 LNCS, Issue , 2008, Pages 190-201

  Traxler, Patrick ^a  

^a ETH ZURICH   (Switzerland)

Author keywords

[No Author keywords available]

Indexed keywords

CONSTRAINT THEORY; DECISION MAKING; PROBLEM SOLVING;

CONSTRAINT SYSTEM; EXPONENTIAL TIME HYPOTHESIS; SATISFIABILITY;

COMPUTATIONAL COMPLEXITY;

EID: 44649191880     PISSN: 03029743     EISSN: 16113349     Source Type: Book Series    
DOI: 10.1007/978-3-540-79723-4_18     Document Type: Conference Paper

References (15)

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)
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)
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)
4. Feder, T., Motwani, R.: Worst-case time bounds for coloring and satisfiability problems. J. Algorithms 45(2), 192-201 (2002)
5. Haxell, P.E.: A condition for matchability in hypergraphs. Graphs and Combinatorics 11, 245-248 (1995)
6. Impagliazzo, R., Paturi, R.: On the complexity of k-SAT. J. Computer and System Sciences 62(2), 367-375 (2001)
7. Impagliazzo, R., Paturi, R., Zane, F.: Which problems have strongly exponential complexity? J. Computer and System Sciences 63(4), 512-530 (2001)
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)
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)
10. n) 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)
11. Mulmuley, K., Vazirani, U.V., Vazirani, V.V.: Matching is as easy as matrix inversion. Combinatorica 7(1), 105-113 (1987)
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)
13. Scott, A.D., Sorkin, G.B.: An LP-Designed Algorithm for Constraint Satisfaction. In: Azar, Y., Erlebach, T. (eds.) ESA 2006. LNCS, vol. 4168, pp. 588-599. Springer, Heidelberg (2006)
14. Valiant, L.G., Vazirani, V.V.: NP is as easy as detecting unique solutions. Theoretical Computer Science 47(1), 85-93 (1986)
15. Williams, R.: A new algorithm for optimal 2-constraint satisfaction and its implications. Theoretical Computer Science 348(2-3), 357-365 (2005)