Rounding meets approximate model counting
type: Item
instance of: scholarly article
title: Rounding meets approximate model counting
zbMATH Open document ID: 1545.68077
DOI: 10.1007/978-3-031-37703-7_7
author: Jiong Yang
author: Kuldeep S. Meel
publication date: 2024-01-12T00:00:00Z
Mathematics Subject Classification ID: 68Q60
Mathematics Subject Classification ID: 68R07
zbMATH DE Number: 7787551
MaRDI profile type: Publication
cites work: Universal classes of hash functions
cites work: Randomized Synthesis for Diversity and Cost Constraints with Control Improvisation
cites work: Q5740444
cites work: Treewidth and counting projected answer sets
cites work: On computing minimal independent support and its applications to sampling and counting
cites work: Sparse Hashing for Scalable Approximate Model Counting
cites work: On the hardness of approximate reasoning
cites work: Tinted, detached, and lazy CNF-XOR solving and its applications to counting and sampling
cites work: Optimal orientations of cells in slicing floorplan designs
cites work: Quantifying software reliability via model-counting
cites work: The Complexity of Enumeration and Reliability Problems
cites work: Projected model counting: beyond independent support
description: scientific article; zbMATH DE number 7787551