The relative exponential time complexity of approximate counting satisfying assignments (Q309794)
From MaRDI portal
scientific article
| Language | Label | Description | Also known as |
|---|---|---|---|
| English | The relative exponential time complexity of approximate counting satisfying assignments |
scientific article |
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
