Algorithms for Counting 2-Sat Solutions and Colorings with Applications

2007/06/25 by Martin Fürer, Shiva Prasad Kasiviswanathan · 1 citation
Computer Science · Engineering · #Advanced Graph Theory Research #Computer science #Data Management and Algorithms #graph theory and CDMA systems

paper · doi:10.1007/978-3-540-72870-2_5

openalex publication_date 2007/06/25 · crossref created 2007/06/25 · crossref deposited 2020/11/19 · crossref indexed 2024/09/05 · openalex created_date 2025/10/10 · openalex updated_date 2026/07/29

Citations

• The Design and Analysis of Algorithms
• 3-coloring in time
• The complexity of computing the permanent
• The Complexity of Enumeration and Reliability Problems
• Counting models for 2SAT and 3SAT formulae

Cited by

• 2-satisfiability [wikipedia]