Algorithms for counting 2-SAT solutions and colorings with applications

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

Volumn 4508 LNCS, Issue , 2007, Pages 47-57

  Fürer, Martin ^a   Kasiviswanathan, Shiva Prasad ^a  

^a PENNSYLVANIA STATE UNIVERSITY   (United States)

Author keywords

[No Author keywords available]

Indexed keywords

COMPUTER SCIENCE; GRAPH THEORY; POLYNOMIALS;

WEIGHT SATISFYING ASSIGNMENTS;

ALGORITHMS;

EID: 38149122178     PISSN: 03029743     EISSN: 16113349     Source Type: Book Series    
DOI: 10.1007/978-3-540-72870-2_5     Document Type: Conference Paper

References (20)

1. ANGELSMARK, O. Constructing algorithms for constraint satisfaction and related problems : Methods and applications. PhD. thesis, Linköping University (2005).
2. n). Journal of Algorithms 54, 2 (2005), 168-204.
3. BJÖRKLUND, A., AND HUSFELDT, T. Inclusion-exclusion algorithms for counting set partitions. In Foundations of Computer Science (2006), IEEE Computer Society, pp. 575-582.
4. DAHLLÖF, V., AND JONSSON, P. An algorithm for counting maximum weighted independent sets and its applications. In Symposium on Discrete Algorithms (2002), SIAM, pp. 292-298.
5. DAHLLÖF, V., JONSSON, P., AND WAHLSTRÖM, M. Counting satisfying assignments in 2-SAT and 3-SAT. In Annual International Computing and Combinatorics Conference (COCOON) (2002), vol. 2387, Springer, pp. 535-543.
6. DAHLLÖF, V., JONSSON, P., AND WAHLSTRÖM, M. Counting models for 2SAT and 3SAT formulae. Theoretical Computer Science 332, 1-3 (2005), 265-291.
7. DANTSIN, E., GAVRILOVICH, M., HIRSCH, E., AND KONEV, B. MAX SAT approximation beyond the limits of polynomial-time approximation. Annals of Pure and Applied Logic 113 (2002), 81-94.
8. DAVIS, M., LOGEMANN, G., AND LOVELAND, D. A machine program for theoremproving. Communications of the ACM 5, 7 (1962), 394-397.
9. DAVIS, M., AND PUTNAM, H. A computing procedure for quantification theory. Journal of Association Computer Machinery 7 (1960), 201-215.
10. DUBOIS, O. Counting the number of solutions for instances of satisfiability. Theoretical Computer Science 81, 1 (1991), 49-64.
11. FÜRER, M., AND KASIVISWANATHAN, S. P. Algorithms for counting 2-SAT solutions and colorings with applications. TR05-033, Electronic Colloquium on Computational Complexity, 2005.
12. n) algorithm for graph coloring and other partitioning problems via inclusion-exclusion. In Foundations of Computer Science (2006), IEEE Computer Society, pp. 583-590.
13. KOZEN, D. C. The Design and Analysis of Algorithms. Springer, Berlin, 1992.
14. KULLMANN, O. New methods for 3-SAT decision and worst-case analysis. Theoretical Computer Science 223 (1999), 1-72.
15. LITTMAN, M. L., PITASSI, T., AND IMPAGLIAZZO, R. On the complexity of counting satisfying assignments. In The Working notes of LICS 2001 Workshop on Satisfiability (2001).
16. ROTH, D. On the hardness of approximate reasoning. Artificial Intelligence 82, 1-2 (1996), 273-302.
17. VADHAN, S. P. The complexity of counting in sparse, regular, and planar graphs. SIAM Journal on Computing 31, 2 (2002), 398-427.
18. VALIANT, L. G. The complexity of computing the permanent. Theoretical Computer Science 8, 2 (1979), 189-201.
19. VALIANT, L. G. The complexity of enumeration and reliability problems. SIAM Journal of Computing 8, 3 (1979), 410-421.
20. ZHANG, W. Number of models and satisfiability of sets of clauses. Theoretical Computer Science 155, 1 (1996), 277-288.