The complexity of constraint satisfaction games and QCSP (Q840700)

From MaRDI portal
Revision as of 06:06, 11 February 2024 by RedirectionBot (talk | contribs) (‎Changed an Item)
scientific article
Language Label Description Also known as
English
The complexity of constraint satisfaction games and QCSP
scientific article

    Statements

    title
    The complexity of constraint satisfaction games and QCSP (English)
    0 references
    author
    Andrei A. Bulatov
    0 references
    Hubie Chen
    0 references
    Ferdinand Börner
    0 references
    Peter G. Jeavons
    0 references
    Andrei A. Krokhin
    0 references
    publication date
    14 September 2009
    0 references
    Mathematics Subject Classification ID
    68T20
    0 references
    68Q25
    0 references
    91A05
    0 references
    zbMATH DE Number
    5603605
    0 references
    zbMATH Keywords
    constraint satisfaction
    0 references
    games
    0 references
    quantified constraint satisfaction problem
    0 references
    polymorphisms
    0 references
    complexity
    0 references
    algorithms
    0 references
     
    Retrieved from "https://portal.mardi4nfdi.de/w/index.php?title=Item:Q840700&oldid=20569968"
    Powered by MediaWiki