Polynomial constraint satisfaction problems, graph bisection, and the Ising partition function (Q2930272)

From MaRDI portal
Revision as of 10:58, 19 April 2024 by Importer (talk | contribs) (‎Changed an Item)
(diff) ← Older revision | Latest revision (diff) | Newer revision → (diff)
scientific article
Language Label Description Also known as
English
Polynomial constraint satisfaction problems, graph bisection, and the Ising partition function
scientific article

    Statements

    Polynomial constraint satisfaction problems, graph bisection, and the Ising partition function (English)
    0 references
    0 references
    0 references
    18 November 2014
    0 references
    exponential-time algorithm
    0 references
    constraint satisfaction
    0 references
    discrete optimization
    0 references
    exact algorithm
    0 references
    generating function
    0 references
    partition function
    0 references

    Identifiers

    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references