Rounding meets approximate model counting

DOI10.1007/978-3-031-37703-7_7zbMATH Open1545.68077MaRDI QIDQ6535531FDOQ6535531

Authors: Jiong Yang, Kuldeep S. Meel 

Publication date: 12 January 2024

Recommendations

• A new probabilistic algorithm for approximate model counting
• Two approximate algorithms for model counting
• On hashing-based approaches to approximate DNF-counting
• Fast and flexible probabilistic model counting
• Model counting: a new stategy for obtaining good bounds

Mathematics Subject Classification ID

Specification and verification (program logics, model checking, etc.) (68Q60) Computational aspects of satisfiability (68R07)

Cites Work

• Universal classes of hash functions
• On computing minimal independent support and its applications to sampling and counting
• The Complexity of Enumeration and Reliability Problems
• On the hardness of approximate reasoning
• Optimal orientations of cells in slicing floorplan designs
• Model counting: a new stategy for obtaining good bounds
• Sparse Hashing for Scalable Approximate Model Counting
• Quantifying software reliability via model-counting
• Tinted, detached, and lazy CNF-XOR solving and its applications to counting and sampling
• Treewidth and counting projected answer sets
• Projected model counting: beyond independent support
• Randomized Synthesis for Diversity and Cost Constraints with Control Improvisation

Cited In (1)

• Approximate Model Counting, Sparse XOR Constraints and Minimum Distance

This page was built for publication: Rounding meets approximate model counting

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