The authors derive a new 2-tree expansion for constraint marginals and use it to give deterministic and randomized approximate counting algorithms for general CSPs in the regime p(D+1)^2 <= 1/(4e).
Title resolution pending
1 Pith paper cite this work. Polarity classification is still indexing.
1
Pith paper citing it
fields
cs.DS 1years
2026 1verdicts
REJECT 1representative citing papers
citing papers explorer
-
A Counting Lov\'asz Local Lemma
The authors derive a new 2-tree expansion for constraint marginals and use it to give deterministic and randomized approximate counting algorithms for general CSPs in the regime p(D+1)^2 <= 1/(4e).