Abstract
To count models for two conjunctive forms (#2SAT problem) is a classic #P problem. We determine different structural patterns on the underlying graph of a 2-CF F allowing the efficient computation of #2SAT(F). We show that if the constrained graph of a formula is acyclic or the cycles on the graph can be arranged as independent and embedded cycles, then the number of models of F can be counted efficiently. © 2013 Springer-Verlag Berlin Heidelberg.
Author supplied keywords
Cite
CITATION STYLE
De Ita, G., Bello, P., & Contreras, M. (2013). Recognizing structural patterns on graphs for the efficient computation of #2SAT. In Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics) (Vol. 7914 LNCS, pp. 274–283). https://doi.org/10.1007/978-3-642-38989-4_28
Register to see more suggestions
Mendeley helps you to discover research relevant for your work.
