On hashing-based approaches to approximate DNF-counting
From MaRDI portal
(Redirected from Publication:5136333)
Recommendations
- Not all FPRASs are equal: demystifying FPRASs for DNF-counting
- A new probabilistic algorithm for approximate model counting
- Theory and Applications of Satisfiability Testing
- Two approximate algorithms for model counting
- Tinted, detached, and lazy CNF-XOR solving and its applications to counting and sampling
Cites work
- An Optimal Algorithm for Monte Carlo Estimation
- scientific article; zbMATH DE number 2176112 (Why is no real title available?)
- scientific article; zbMATH DE number 1888461 (Why is no real title available?)
- scientific article; zbMATH DE number 2243356 (Why is no real title available?)
- Model counting: a new stategy for obtaining good bounds
- Monte-Carlo approximation algorithms for enumeration problems
- On computing minimal independent support and its applications to sampling and counting
- On the hardness of approximate reasoning
- Probabilistic planning via heuristic forward search and weighted model counting
- Random generation of combinatorial structures from a uniform distribution
- Short XORs for Model Counting: From Theory to Practice
- The Complexity of Enumeration and Reliability Problems
Cited in
(8)- A new probabilistic algorithm for approximate model counting
- Not all FPRASs are equal: demystifying FPRASs for DNF-counting
- Approximate weighted model integration on DNF structures
- Tinted, detached, and lazy CNF-XOR solving and its applications to counting and sampling
- Open-world probabilistic databases: semantics, algorithms, complexity
- Model counting meets \(F_0\) estimation
- Rounding meets approximate model counting
- IASCAR: incremental answer set counting by anytime refinement
This page was built for publication: On hashing-based approaches to approximate DNF-counting
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q5136333)
