A new succinct decision-ZDNNF representation and parallel DXD algorithm for counting exact covers outperform prior ZBDD-based methods in experiments.
Exact Cover via Satisfiability: An Empirical Study
1 Pith paper cite this work. Polarity classification is still indexing.
1
Pith paper citing it
fields
cs.AI 1years
2026 1verdicts
UNVERDICTED 1representative citing papers
citing papers explorer
-
A Parallel Approach to Counting Exact Covers Based on Decomposability Property
A new succinct decision-ZDNNF representation and parallel DXD algorithm for counting exact covers outperform prior ZBDD-based methods in experiments.