A tighter bound for counting max-weight solutions to 2SAT instances

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

Volumn 5018 LNCS, Issue , 2008, Pages 202-213

  Wahlström, Magnus ^a  

^a MAX PLANCK INSTITUTE FOR INFORMATICS   (Germany)

Author keywords

[No Author keywords available]

Indexed keywords

COMPUTATIONAL COMPLEXITY; MULTIVARIABLE SYSTEMS; PARAMETER ESTIMATION;

MAX-WEIGHT SOLUTIONS; MULTIVARIATE MEASURES;

PROBLEM SOLVING;

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

References (17)

1. Brueggemann, T., Kern, W.: An improved deterministic local search algorithm for 3-SAT. Theoretical Computer Science 329(1-3), 303-313 (2004)
2. Dahllöf, V., Jonsson, P., Wahlström, M.: Counting satisfying assignments in 2-SAT and 3-SAT. In: H. Ibarra, O., Zhang, L. (eds.) COCOON 2002. LNCS, vol. 2387, pp. 535-543. Springer, Heidelberg (2002)
3. Dahllöf, V., Jonsson, P., Wahlström, M.: Counting models for 2-SAT and 3-SAT formulae. Theoretical Computer Science 332(1-3), 265-291 (2005)
4. Dubois, O.: Counting the number of solutions for instances of satisfiability. Theoretical Computer Science 81, 49-64 (1991)
5. Eppstein, D.: Quasiconvex analysis of backtracking algorithms. In: Proceedings of the 15th annual ACM-SIAM symposium on Discrete algorithms (SODA 2004), pp. 788-797 (2004)
6. Fomin, F.V., Grandoni, F., Kratsch, D.: Some new techniques in design and analysis of exact (exponential) algorithms. Bulletin of the EATCS 87, 47-77 (2005)
7. Fürer, M., Kasiviswanathan, S.P.: Algorithms for counting 2-SAT solutions and colorings with applications. Electronic Colloquium on Computational Complexity (ECCC) 5(033) (2005)
8. Iwama, K., Tamaki, S.: Improved upper bounds for 3-SAT. In: Proceedings of the 15th Annual ACM-SIAM Symposium on Discrete Algorithms (SODA 2004), p. 328 (2004)
9. Kozen, D.: The design and analysis of algorithms. Springer, New York (1992)
10. Littman, M., Pitassi, T., Impagliazzo, R.: On the complexity of counting satisfying assignments. In: The working notes of the LICS 2001 workshop on Satisfiability (2001)
11. Ryser, H.J.: Combinatorial Mathematics. The Mathematical Association of America, Washington (1963)
12. Toda, S.: PP is as hard as the polynomial-time hierarchy. SIAM Journal on Computing 20(5), 865-877 (1991)
13. Valiant, L.: The complexity of enumeration and reliability problems. SIAM Journal of Computing 8, 410-421 (1979)
14. Valiant, L.G.: The complexity of computing the permanent. Theoretical Computer Science 8, 189-201 (1979)
15. Wahlström, M.: An algorithm for the SAT problem for formulae of linear length. In: Brodal, G.S., Leonardi, S. (eds.) ESA 2005. LNCS, vol. 3669, pp. 107-118. Springer, Heidelberg (2005)
16. Wahlström, M.: Algorithms, measures, and upper bounds for satisfiability and related problems. Linköping Studies in Science and Technology, PhD Dissertation no. 1079 (2007), http://urn.kb.se/resolve?urn=urn: nbn:se:liu:diva-8714
17. Zhang, W.: Number of models and satisfiability of sets of clauses. Theoretical Computer Science 155, 277-288 (1996)