Solving #SAT using vertex covers
- 3 September 2007
- journal article
- research article
- Published by Springer Nature in Acta Informatica
- Vol. 44 (7-8) , 509-523
Abstract
No abstract availableKeywords
This publication has 22 references indexed in Scilit:
- Counting truth assignments of formulas of bounded tree-width or clique-widthDiscrete Applied Mathematics, 2008
- Fixed-Parameter Algorithms For Artificial Intelligence, Constraint Satisfaction and Database ProblemsThe Computer Journal, 2007
- Fixed-parameter complexity in AI and nonmonotonic reasoningArtificial Intelligence, 2002
- Vertex Cover: Further Observations and Further ImprovementsJournal of Algorithms, 2001
- Satisfiable Formulas Closed Under ReplacementElectronic Notes in Discrete Mathematics, 2001
- On the fixed parameter complexity of graph enumeration problems definable in monadic second-order logicDiscrete Applied Mathematics, 2001
- Upper bounds to the clique width of graphsDiscrete Applied Mathematics, 2000
- A partial k-arboretum of graphs with bounded treewidthTheoretical Computer Science, 1998
- On the hardness of approximate reasoningArtificial Intelligence, 1996
- The complexity of computing the permanentTheoretical Computer Science, 1979