The relative exponential time complexity of approximate counting satisfying assignments (Q2946032)
From MaRDI portal
!
This is the item page for this Wikibase entity, intended for internal use and editing purposes. Please use the normal view instead:
scientific article; zbMATH DE number 6482369
| Language | Label | Description | Also known as |
|---|---|---|---|
| default for all languages | No label defined |
||
| English | The relative exponential time complexity of approximate counting satisfying assignments |
scientific article; zbMATH DE number 6482369 |
Statements
The Relative Exponential Time Complexity of Approximate Counting Satisfying Assignments (English)
0 references
15 September 2015
0 references
0 references
0.9999986886978148
0 references
0.8016104698181152
0 references
0.7675057649612427
0 references
