Rounding meets approximate model counting

DOI10.1007/S10703-025-00481-6MaRDI QIDQ6903892zbMATH OpenFDO

Authors Jiong Yang, Kuldeep S. Meel

Publication date 7 November 2025

Published in Formal Methods in System Design (Search for Journal in Brave)

Copyright license Creative Commons Attribution 4.0 International

Full work available at URL https://doi.org/10.1007/S10703-025-00481-6

zbMATH Keywords

model countingPAC guaranteerounding

Mathematics Subject Classification ID

Logic in computer science (03B70) Analysis of algorithms and problem complexity (68Q25) Computational aspects of satisfiability (68R07)

Cites work

• On computing minimal independent support and its applications to sampling and counting
• On the hardness of approximate reasoning
• Randomized Synthesis for Diversity and Cost Constraints with Control Improvisation
• Sparse Hashing for Scalable Approximate Model Counting
• The Complexity of Enumeration and Reliability Problems
• Tinted, detached, and lazy CNF-XOR solving and its applications to counting and sampling

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 Q6903892)