New branch-and-search algorithms solve weighted #2-SAT in O*(1.1082^m) time and weighted #3-SAT in O*(1.4423^m) time, improving known clause-count bounds.
Counting models for 2sat and 3sat for- mulae
1 Pith paper cite this work, alongside 87 external citations. Polarity classification is still indexing.
1
Pith paper citing it
87
external citations · OpenAlex
citation-role summary
background 1
citation-polarity summary
fields
cs.DS 1years
2025 1verdicts
CONDITIONAL 1roles
background 1polarities
unclear 1representative citing papers
citing papers explorer
-
New Algorithms for #2-SAT and #3-SAT
New branch-and-search algorithms solve weighted #2-SAT in O*(1.1082^m) time and weighted #3-SAT in O*(1.4423^m) time, improving known clause-count bounds.