On the Subexponential-Time Complexity of CSP (Q5176853)

From MaRDI portal
Revision as of 16:01, 28 August 2024 by Daniel (talk | contribs) (‎Created claim: Wikidata QID (P12): Q129489682, #quickstatements; #temporary_batch_1724856715312)
(diff) ← Older revision | Latest revision (diff) | Newer revision → (diff)
scientific article; zbMATH DE number 6411225
Language Label Description Also known as
English
On the Subexponential-Time Complexity of CSP
scientific article; zbMATH DE number 6411225

    Statements

    title
    On the Subexponential-Time Complexity of CSP (English)
    0 references
    author
    Ronald de Haan
    0 references
    Stefan Szeider
    0 references
    Iyad A. Kanj
    0 references
    publication date
    4 March 2015
    0 references

    Identifiers

    DOI
    10.1613/jair.4540
    0 references
    Mathematics Subject Classification ID
    68Q25
    0 references
    68Q17
    0 references
    68T20
    0 references
    zbMATH DE Number
    6411225
    0 references
    OpenAlex ID
    W2129131081
    0 references
    Wikidata QID
    Q129489682
    0 references
     
    Retrieved from "https://portal.mardi4nfdi.de/w/index.php?title=Item:Q5176853&oldid=37651631"
    Powered by MediaWiki