The Relative Exponential Time Complexity of Approximate Counting Satisfying Assignments (Q2946032)
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
15 September 2015
0 references
0 references
