On Problems as Hard as CNF-SAT (Q4962605)

From MaRDI portal
Revision as of 21:57, 19 April 2024 by Importer (talk | contribs) (‎Changed an Item)
(diff) ← Older revision | Latest revision (diff) | Newer revision → (diff)
scientific article; zbMATH DE number 6972766
Language Label Description Also known as
English
On Problems as Hard as CNF-SAT
scientific article; zbMATH DE number 6972766

    Statements

    title
    On Problems as Hard as CNF-SAT (English)
    0 references
    DOI
    10.1145/2925416
    0 references
    author
    Marek Cygan
    0 references
    Holger Dell
    0 references
    Daniel Lokshtanov
    0 references
    Dániel Marx
    0 references
    Jesper Nederlof
    0 references
    Yoshio Okamoto
    0 references
    Ramamohan Paturi
    0 references
    Saket Saurabh
    0 references
    Magnus Wahlström
    0 references
    publication date
    5 November 2018
    0 references
    Mathematics Subject Classification ID
    68Q17
    0 references
    68R05
    0 references
    68R07
    0 references
    68R10
    0 references
    68W40
    0 references
    zbMATH DE Number
    6972766
    0 references
    zbMATH Keywords
    optimal growth rate
    0 references
    reduction
    0 references
    satisfiability
    0 references
    strong exponential-time hypothesis
    0 references
    OpenAlex ID
    W2404960361
    0 references
    arXiv ID
    1112.2275
    0 references
     
    Retrieved from "https://portal.mardi4nfdi.de/w/index.php?title=Item:Q4962605&oldid=33693962"
    Powered by MediaWiki