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

From MaRDI portal
Revision as of 11:36, 30 July 2023 by Importer (talk | contribs) (‎Created a new Item)
(diff) ← Older revision | Latest revision (diff) | Newer revision → (diff)
scientific article
Language Label Description Also known as
English
The complexity of planar Boolean \#CSP with complex weights
scientific article

    Statements

    The complexity of planar Boolean \#CSP with complex weights (English)
    0 references
    0 references
    0 references
    29 November 2019
    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