The complexity of satisfiability problems: Refining Schaefer's theorem (Q1015812)

From MaRDI portal
scientific article
Language Label Description Also known as
English
The complexity of satisfiability problems: Refining Schaefer's theorem
scientific article

    Statements

    The complexity of satisfiability problems: Refining Schaefer's theorem (English)
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    30 April 2009
    0 references
    computational complexity
    0 references
    constraint satisfaction problem
    0 references
    propositional satisfiability
    0 references
    clone theory
    0 references
    0 references
    0 references
    0 references

    Identifiers