The complexity of constraint satisfaction games and QCSP (Q840700)

From MaRDI portal
Revision as of 23:53, 1 July 2024 by ReferenceBot (talk | contribs) (‎Changed an Item)
(diff) ← Older revision | Latest revision (diff) | Newer revision → (diff)
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
    OpenAlex ID
    W2076946745
    0 references
    cites work
    Computer Science Logic
    0 references
    STACS 2005
    0 references
    Q4737176
    0 references
    Q4198056
    0 references
    Q3365840
    0 references
    Q3221403
    0 references
    Q4354427
    0 references
    Q3208654
    0 references
    Q4252522
    0 references
    Q3739181
    0 references
    Q4828947
    0 references
     
    Retrieved from "https://portal.mardi4nfdi.de/w/index.php?title=Item:Q840700&oldid=35127225"
    Powered by MediaWiki