Counting the number of solutions for instances of satisfiability
Theoretical Computer Science
The design and analysis of algorithms
The design and analysis of algorithms
On the hardness of approximate reasoning
Artificial Intelligence
Number of models and satisfiability of sets of clauses
Theoretical Computer Science
The Complexity of Planar Counting Problems
SIAM Journal on Computing
The complexity of counting colourings and independent sets in sparse graphs and hypergraphs
Computational Complexity
An algorithm for counting maximum weighted independent sets and its applications
SODA '02 Proceedings of the thirteenth annual ACM-SIAM symposium on Discrete algorithms
Concrete Mathematics: A Foundation for Computer Science
Concrete Mathematics: A Foundation for Computer Science
The Complexity of Counting in Sparse, Regular, and Planar Graphs
SIAM Journal on Computing
Counting Models Using Connected Components
Proceedings of the Seventeenth National Conference on Artificial Intelligence and Twelfth Conference on Innovative Applications of Artificial Intelligence
The good old Davis-Putnam procedure helps counting models
Journal of Artificial Intelligence Research
Determining the Number of Solutions to Binary CSP Instances
CP '02 Proceedings of the 8th International Conference on Principles and Practice of Constraint Programming
Counting for Satisfiability by Inverting Resolution
Artificial Intelligence Review
Counting models for 2SAT and 3SAT formulae
Theoretical Computer Science
New upper bound for the #3-SAT problem
Information Processing Letters
Bounded list injective homomorphism for comparative analysis of protein-protein interaction graphs
Journal of Discrete Algorithms
Algorithms for Counting 2-Sat Solutions and Colorings with Applications
AAIM '07 Proceedings of the 3rd international conference on Algorithmic Aspects in Information and Management
A tighter bound for counting max-weight solutions to 2SAT instances
IWPEC'08 Proceedings of the 3rd international conference on Parameterized and exact computation
A Threshold for a Polynomial Solution of #2SAT
Fundamenta Informaticae - Latin American Workshop on Logic Languages, Algorithms and New Methods of Reasoning (LANMR)
| Hi-index | 0.00 |
We present an O(1.3247n) algorithm for counting the number of satisfying assignments for instances of 2-SAT and an O(1.6894n) algorithm for instances of 3-SAT. This is an improvement compared to the previously best known algorithms running in O(1.381n) and O(1.739n) time, respectively.