The Complexity of Promise SAT on Non-Boolean Domains (Q5066145)

From MaRDI portal
scientific article; zbMATH DE number 7499574
Language Label Description Also known as
English
The Complexity of Promise SAT on Non-Boolean Domains
scientific article; zbMATH DE number 7499574

    Statements

    The Complexity of Promise SAT on Non-Boolean Domains (English)
    0 references
    0 references
    0 references
    0 references
    29 March 2022
    0 references
    promise constraint satisfaction
    0 references
    PCSP
    0 references
    polymorphisms
    0 references
    algebraic approach
    0 references
    label cover
    0 references

    Identifiers

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