The complexity of planar Boolean \#CSP with complex weights (Q2009629)

From MaRDI portal
Revision as of 09:33, 6 May 2024 by EloiFerrer (talk | contribs) (‎Merged Item from Q5326588)
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
  • The Complexity of Planar Boolean #CSP with Complex Weights

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
0 references
0 references
0 references
0 references
29 November 2019
0 references
6 August 2013
0 references
0 references
0 references
0 references
0 references
0 references
0 references
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