The complexity of planar Boolean \#CSP with complex weights (Q2009629): Difference between revisions
From MaRDI portal
Changed an Item |
EloiFerrer (talk | contribs) Changed label, description and/or aliases in en, and other parts |
||
| description / en | description / en | ||
Revision as of 15:07, 2 May 2024
No description defined
| Language | Label | Description | Also known as |
|---|---|---|---|
| English | The complexity of planar Boolean \#CSP with complex weights |
No description defined |
Statements
The complexity of planar Boolean \#CSP with complex weights (English)
0 references
29 November 2019
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
