Approximate Model Counting, Sparse XOR Constraints and Minimum Distance

DOI10.1007/978-3-030-31175-9_21MaRDI QIDQ6489032zbMATH OpenFDO

Authors Michele Boreale, Daniele Gorla

Publication date 14 March 2024

Full work available at URL https://doi.org/10.1007/978-3-030-31175-9_21

Mathematics Subject Classification ID

Computational aspects of satisfiability (68R07) Problem solving in the context of artificial intelligence (heuristics, search strategies, etc.) (68T20)

Recommendations

• Short XORs for Model Counting: From Theory to Practice
• Model counting: a new stategy for obtaining good bounds
• Probabilistic model counting with short XORs
• Fast and flexible probabilistic model counting
• Rounding meets approximate model counting

This page was built for publication: Approximate Model Counting, Sparse XOR Constraints and Minimum Distance

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q6489032)