Rounding meets approximate model counting

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

Jiong Yang, Kuldeep S. Meel

Publication date: 12 January 2024

Mathematics Subject Classification ID

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

Cites Work

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

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