The complexity of planar Boolean \#CSP with complex weights (Q2009629)
From MaRDI portal
(Redirected from Item:Q5326588)
 | 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 complexity of planar Boolean \#CSP with complex weights |
scientific article; zbMATH DE number 6195452
- The Complexity of Planar Boolean #CSP with Complex Weights
| Language | Label | Description | Also known as |
|---|---|---|---|
| English | The complexity of planar Boolean \#CSP with complex weights |
scientific article; zbMATH DE number 6195452 |
|
Statements
The complexity of planar Boolean \#CSP with complex weights (English)
0 references
The Complexity of Planar Boolean #CSP with Complex Weights (English)
0 references
29 November 2019
0 references
6 August 2013
0 references
counting complexity
0 references
constraint satisfaction problems
0 references
\#P
0 references
dichotomy
0 references
planar graphs
0 references
holographic algorithms
0 references
0 references
0 references
0 references
0.9618088603019714
0 references
0.8630824685096741
0 references
0.8268330693244934
0 references
