Short XORs for Model Counting: From Theory to Practice
From MaRDI portal
Recommendations
Cited in
(14)- Probabilistic model counting with short XORs
- Model counting with error-correcting codes
- In search of balance: the challenge of generating balanced Latin rectangles
- Testing in ASP: revisited language and programming environment
- Towards an answer set programming methodology for constructing programs following a semi-automatic approach -- extended and revised version
- Tinted, detached, and lazy CNF-XOR solving and its applications to counting and sampling
- The return of \textit{xorro}
- On computing minimal independent support and its applications to sampling and counting
- A study of symmetry breaking predicates and model counting
- On hashing-based approaches to approximate DNF-counting
- Model counting: a new stategy for obtaining good bounds
- Projected model counting: beyond independent support
- Approximate Model Counting, Sparse XOR Constraints and Minimum Distance
- Model counting meets \(F_0\) estimation
This page was built for publication: Short XORs for Model Counting: From Theory to Practice
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q3612459)