Time Complexity of Constraint Satisfaction via Universal Algebra (Q5111231)

From MaRDI portal
Revision as of 15:58, 30 December 2024 by Import241228121245 (talk | contribs) (Normalize DOI.)
(diff) ← Older revision | Latest revision (diff) | Newer revision → (diff)
scientific article; zbMATH DE number 7204351
Language Label Description Also known as
English
Time Complexity of Constraint Satisfaction via Universal Algebra
scientific article; zbMATH DE number 7204351

    Statements

    author
    Peter Jonsson
    0 references
    Victor Lagerkvist
    0 references
    Biman Roy
    0 references
    publication date
    26 May 2020
    0 references
    zbMATH Keywords
    clone theory
    0 references
    universal algebra
    0 references
    constraint satisfaction problems
    0 references
    cites work
    Give Me Another One!
    0 references
    As Close as It Gets
    0 references
    Q4411838
    0 references
    Q5389338
    0 references
    Q3184605
    0 references
    Q4843187
    0 references
    title
    Time Complexity of Constraint Satisfaction via Universal Algebra (English)
    0 references

    Identifiers

    Mathematics Subject Classification ID
    68Q25
    0 references
    08A40
    0 references
    08A70
    0 references
    68Q17
    0 references
    68Q27
    0 references
    68R07
    0 references
    zbMATH DE Number
    7204351
    0 references
    arXiv ID
    1706.05902
    0 references
    OpenAlex ID
    W2705838778
    0 references
     
    Retrieved from "https://portal.mardi4nfdi.de/w/index.php?title=Item:Q5111231&oldid=39533832"
    Powered by MediaWiki