Counting models for 2SAT and 3SAT formulae
Under an Elsevier user license
open archive
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.
Copyright © 2004 Elsevier B.V. All rights reserved.