Not all FPRASs are equal: demystifying FPRASs for DNF-counting (Q2009190)
From MaRDI portal
 | This is the item page for this Wikibase entity, intended for internal use and editing purposes. Please use this page instead for the normal view: Not all FPRASs are equal: demystifying FPRASs for DNF-counting |
scientific article; zbMATH DE number 7137186
| Language | Label | Description | Also known as |
|---|---|---|---|
| English | Not all FPRASs are equal: demystifying FPRASs for DNF-counting |
scientific article; zbMATH DE number 7137186 |
Statements
Not all FPRASs are equal: demystifying FPRASs for DNF-counting (English)
0 references
27 November 2019
0 references
model counting
0 references
hashing
0 references
disjunctive normal form
0 references
Boolean formulas
0 references
fully polynomial randomized approximation scheme
0 references
0 references
0 references
