The relative exponential time complexity of approximate counting satisfying assignments (Q309794)
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: The relative exponential time complexity of approximate counting satisfying assignments |
scientific article; zbMATH DE number 6624622
| Language | Label | Description | Also known as |
|---|---|---|---|
| English | The relative exponential time complexity of approximate counting satisfying assignments |
scientific article; zbMATH DE number 6624622 |
Statements
The relative exponential time complexity of approximate counting satisfying assignments (English)
0 references
7 September 2016
0 references
approximate counting
0 references
exponential-time complexity
0 references
hashing
0 references
randomness extraction
0 references
0 references
