Pages that link to "Item:Q2009190"
From MaRDI portal
The following pages link to Not all FPRASs are equal: demystifying FPRASs for DNF-counting (Q2009190):
Displaying 5 items.
- DNF sparsification and a faster deterministic counting algorithm (Q354649) (← links)
- Enumerating models of DNF faster: breaking the dependency on the formula size (Q1983134) (← links)
- #NFA Admits an FPRAS: Efficient Enumeration, Counting, and Uniform Generation for Logspace Classes (Q5056438) (← links)
- Model counting meets \(F_0\) estimation (Q6535267) (← links)
- Hashing-based approximate counting of minimal unsatisfiable subsets (Q6632194) (← links)