New algorithms achieve O*(2^{m(1-1/O(d))}) time for Parity-d-occ-SAT, O*(1.1193^n) for d=2, and O*(1.1052^L) for general Parity-SAT, outperforming known #SAT bounds.
Fomin and Kjartan H
1 Pith paper cite this work. Polarity classification is still indexing.
1
Pith paper citing it
fields
cs.DS 1years
2026 1verdicts
UNVERDICTED 1representative citing papers
citing papers explorer
-
New Algorithms for Parity-SAT and Its Bounded-Occurrence Versions
New algorithms achieve O*(2^{m(1-1/O(d))}) time for Parity-d-occ-SAT, O*(1.1193^n) for d=2, and O*(1.1052^L) for general Parity-SAT, outperforming known #SAT bounds.