The property of being polynomial for Mal’tsev constraint satisfaction problems (Q3546063)

From MaRDI portal
Revision as of 19:59, 19 March 2024 by Openalex240319060354 (talk | contribs) (Set OpenAlex properties.)
(diff) ← Older revision | Latest revision (diff) | Newer revision → (diff)
scientific article
Language Label Description Also known as
English
The property of being polynomial for Mal’tsev constraint satisfaction problems
scientific article

    Statements

    title
    The property of being polynomial for Mal’tsev constraint satisfaction problems (English)
    0 references
    author
    Andrei A. Bulatov
    0 references
    publication date
    18 December 2008
    0 references
    Mathematics Subject Classification ID
    08A70
    0 references
    68Q25
    0 references
    68T20
    0 references
    zbMATH DE Number
    5383360
    0 references
    zbMATH Keywords
    computational complexity
    0 references
    CSP
    0 references
    Mal'tsev operation
    0 references
    OpenAlex ID
    W2067565196
    0 references
     
    Retrieved from "https://portal.mardi4nfdi.de/w/index.php?title=Item:Q3546063&oldid=31439327"
    Powered by MediaWiki