Exploiting Independent Subformulas: A Faster Approximation Scheme for #k-SAT

Journal article


Publication Details

Author(s): Schmitt M, Wanka R
Journal: Information Processing Letters
Publisher: Elsevier
Publication year: 2013
Volume: 113
Pages range: 337-344
ISSN: 0020-0190


Abstract


We present an improvement on Thurley's recent randomized approximation scheme for #k-SAT where the task is to count the number of satisfying truth assignments of a Boolean function Φ given as an n-variable k-CNF. We introduce a novel way to identify independent substructures of Φ and can therefore reduce the size of the search space considerably. Our randomized algorithm works for any k. For #3-SAT, it runs in time O(ε- 2×1.51426n), for #4-SAT, it runs in time O(ε-2×1.60816n), with error bound ε. © 2013 Elsevier B.V. All rights reserved.



FAU Authors / FAU Editors

Schmitt, Manuel
Professur für Informatik (Effiziente Algorithmen und Kombinatorische Optimierung)
Wanka, Rolf Prof. Dr.
Professur für Informatik (Effiziente Algorithmen und Kombinatorische Optimierung)


How to cite

APA:
Schmitt, M., & Wanka, R. (2013). Exploiting Independent Subformulas: A Faster Approximation Scheme for #k-SAT. Information Processing Letters, 113, 337-344. https://dx.doi.org/10.1016/j.ipl.2013.02.013

MLA:
Schmitt, Manuel, and Rolf Wanka. "Exploiting Independent Subformulas: A Faster Approximation Scheme for #k-SAT." Information Processing Letters 113 (2013): 337-344.

BibTeX: 

Last updated on 2018-19-04 at 02:44