Strong partial clones and the time complexity of SAT problems (Q340559)

From MaRDI portal
Revision as of 20:41, 19 March 2024 by Openalex240319060354 (talk | contribs) (Set OpenAlex properties.)
scientific article
Language Label Description Also known as
English
Strong partial clones and the time complexity of SAT problems
scientific article

    Statements

    Strong partial clones and the time complexity of SAT problems (English)
    0 references
    0 references
    0 references
    0 references
    0 references
    14 November 2016
    0 references
    satisfiability problems
    0 references
    computational complexity
    0 references
    clone theory
    0 references
    universal algebra
    0 references
    subexponential time
    0 references

    Identifiers

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