Sparse Hashing for Scalable Approximate Model Counting

DOI10.1145/3373718.3394809MaRDI QIDQ5145676OpenAlexFDO

Authors Kuldeep S. Meel, S. Akshay

Publication date 21 January 2021

Published in Proceedings of the 35th Annual ACM/IEEE Symposium on Logic in Computer Science (Search for Journal in Brave)

Full work available at URL https://arxiv.org/abs/2004.14692

zbMATH Keywords

model countingSAT-solvinguniversal hash functionssparse hashing

Mathematics Subject Classification ID

Computer science (68-XX)

Cited in

(9)

• Quantifying software reliability via model-counting
• Model counting meets \(F_0\) estimation
• On almost-uniform generation of SAT solutions: the power of 3-wise independent hashing
• A sparse enhanced indexation model with chance and cardinality constraints
• On the usefulness of linear modular arithmetic in constraint programming
• Rounding meets approximate model counting
• Projected model counting: beyond independent support
• Hashing-based approximate counting of minimal unsatisfiable subsets
• Edge isoperimetric inequalities for powers of the hypercube

This page was built for publication: Sparse Hashing for Scalable Approximate Model Counting

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