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

From MaRDI portal
Revision as of 22:22, 12 July 2024 by ReferenceBot (talk | contribs) (‎Changed an Item)
(diff) ← Older revision | Latest revision (diff) | Newer revision → (diff)
scientific article
Language Label Description Also known as
English
Strong partial clones and the time complexity of SAT problems
scientific article

    Statements

    title
    Strong partial clones and the time complexity of SAT problems (English)
    0 references
    author
    Peter Jonsson
    0 references
    Victor Lagerkvist
    0 references
    Gustav Nordh
    0 references
    Bruno Zanuttini
    0 references
    publication date
    14 November 2016
    0 references
    zbMATH Keywords
    satisfiability problems
    0 references
    computational complexity
    0 references
    clone theory
    0 references
    universal algebra
    0 references
    subexponential time
    0 references
    cites work
    Q5613923
    0 references
    Q5389339
    0 references
    Q4904144
    0 references
    Q3002818
    0 references
    Q3739181
    0 references
    Q4414647
    0 references

    Identifiers

    Mathematics Subject Classification ID
    68Q25
    0 references
    08A40
    0 references
    08A70
    0 references
    68Q17
    0 references
    zbMATH DE Number
    6652739
    0 references
    OpenAlex ID
    W2519743841
    0 references
     
    Retrieved from "https://portal.mardi4nfdi.de/w/index.php?title=Item:Q340559&oldid=36288082"
    Powered by MediaWiki