Holographic algorithm with matchgates is universal for planar #CSP over boolean domain (Q4978028)
From MaRDI portal
 | 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: Holographic algorithm with matchgates is universal for planar #CSP over boolean domain |
scientific article; zbMATH DE number 6761860
| Language | Label | Description | Also known as |
|---|---|---|---|
| English | Holographic algorithm with matchgates is universal for planar #CSP over boolean domain |
scientific article; zbMATH DE number 6761860 |
Statements
Holographic algorithm with matchgates is universal for planar #CSP over boolean domain (English)
0 references
17 August 2017
0 references
holographic reduction
0 references
matchgates
0 references
planar counting constraint satisfaction problems
0 references
