Local search: is brute-force avoidable? (Q439931)

From MaRDI portal
Revision as of 14:21, 5 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
Local search: is brute-force avoidable?
scientific article

    Statements

    title
    Local search: is brute-force avoidable? (English)
    0 references
    author
    Michael R. Fellows
    0 references
    Fedor V. Fomin
    0 references
    Daniel Lokshtanov
    0 references
    Saket Saurabh
    0 references
    Yngve Villanger
    0 references
    Frances A. Rosamond
    0 references
    publication date
    17 August 2012
    0 references
    Mathematics Subject Classification ID
    68T20
    0 references
    68R10
    0 references
    68Q25
    0 references
    05C85
    0 references
    zbMATH DE Number
    6067700
    0 references
    zbMATH Keywords
    parameterized complexity
    0 references
    local search
    0 references
    local treewidth
    0 references
    Wikidata QID
    Q57359626
    0 references
    OpenAlex ID
    W2165930352
    0 references
    cites work
    Q4365129
    0 references
    Q4365126
    0 references
    Q4393480
    0 references
    Q5710169
    0 references
    Q4739657
    0 references
     
    Retrieved from "https://portal.mardi4nfdi.de/w/index.php?title=Item:Q439931&oldid=35293718"
    Powered by MediaWiki