Sparse Hashing for Scalable Approximate Model Counting

DOI10.1145/3373718.3394809OpenAlexW3028996067MaRDI QIDQ5145676

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

universal hash functionsmodel countingSAT-solvingsparse hashing

Mathematics Subject Classification ID

Computer science (68-XX)

Related Items (4)

Edge isoperimetric inequalities for powers of the hypercube ⋮ Quantifying software reliability via model-counting ⋮ Projected model counting: beyond independent support ⋮ On the usefulness of linear modular arithmetic in constraint programming

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