Counting models for 2SAT and 3SAT formulae

https://doi.org/10.1016/j.tcs.2004.10.037Get rights and content
Under an Elsevier user license
open archive

Abstract

We here present algorithms for counting models and max-weight models for 2SAT and 3SAT formulae. They use polynomial space and run in O(1.2561n) and O(1.6737n) time, respectively, where n is the number of variables. This is faster than the previously best algorithms for counting non-weighted models for 2SAT and 3SAT, which run in O(1.3247n) and O(1.6894n) time, respectively. In order to prove these time bounds, we develop new measures of formula complexity, allowing us to conveniently analyze the effects of certain factors with a large impact on the total running time. We also provide an algorithm for the restricted case of separable 2SAT formulae, with fast running times for well-studied input classes. For all three algorithms we present interesting applications, such as computing the permanent of sparse 0/1 matrices.

Keywords

Counting models
Satisfiability
Exponential-time algorithms
Exact algorithms
Upper bounds

Cited by (0)

1

The research is supported by CUGS – National Graduate School in Computer Science, Sweden.

2

Partially supported by the Center for Industrial Information Technology (CENIIT) under Grant 04.01, and by the Swedish Research Council (VR) under Grants 221-2000-361 and 621-2003-3421.