New upper bound for the #3-SAT problem

Authors:
Konstantin Kutzkov
Affiliations:
Department of Computer Science, University of Munich, Oettingenstr. 67, München, Germany
Venue:
Information Processing Letters
Year:
2008

Citing 7
Cited 7

Counting the number of solutions for instances of satisfiability

Theoretical Computer Science
Number of models and satisfiability of sets of clauses

Theoretical Computer Science
New methods for 3-SAT decision and worst-case analysis

Theoretical Computer Science
A Computing Procedure for Quantification Theory

Journal of the ACM (JACM)
A machine program for theorem-proving

Communications of the ACM
Counting Satisfying Assignments in 2-SAT and 3-SAT

COCOON '02 Proceedings of the 8th Annual International Conference on Computing and Combinatorics
Counting models for 2SAT and 3SAT formulae

Theoretical Computer Science

Exponential time complexity of the permanent and the Tutte polynomial

ICALP'10 Proceedings of the 37th international colloquium conference on Automata, languages and programming
An exact algorithm for the Boolean connectivity problem for k-CNF

Theoretical Computer Science
On fast and approximate attack tree computations

ISPEC'10 Proceedings of the 6th international conference on Information Security Practice and Experience
An exact algorithm for the boolean connectivity problem for k-CNF

SAT'10 Proceedings of the 13th international conference on Theory and Applications of Satisfiability Testing
Counting independent sets in claw-free graphs

WG'11 Proceedings of the 37th international conference on Graph-Theoretic Concepts in Computer Science
Counting maximal independent sets in subcubic graphs

SOFSEM'12 Proceedings of the 38th international conference on Current Trends in Theory and Practice of Computer Science
Exploiting independent subformulas: A faster approximation scheme for #k-SAT

Information Processing Letters

Quantified Score

Hi-index	0.89

Visualization

Abstract

We present a new deterministic algorithm for the #3-SAT problem, based on the DPLL strategy. It uses a new approach for counting models of instances with low density. This allows us to assume the adding of more 2-clauses than in previous algorithms. The algorithm achieves a running time of O(1.6423^n) in the worst case which improves the current best bound of O(1.6737^n) by Dahllof et al.