Black-box complexities of combinatorial problems (Q1935820)

From MaRDI portal
Revision as of 23:48, 18 April 2024 by Importer (talk | contribs) (‎Changed an Item)
(diff) ← Older revision | Latest revision (diff) | Newer revision → (diff)
scientific article
Language Label Description Also known as
English
Black-box complexities of combinatorial problems
scientific article

    Statements

    title
    Black-box complexities of combinatorial problems (English)
    0 references
    author
    Benjamin Doerr
    0 references
    Timo Kötzing
    0 references
    Johannes Lengler
    0 references
    Carola Winzen
    0 references
    publication date
    19 February 2013
    0 references
    Mathematics Subject Classification ID
    68T20
    0 references
    90C27
    0 references
    90C60
    0 references
    zbMATH DE Number
    6137363
    0 references
    zbMATH Keywords
    black-box complexity
    0 references
    runtime analysis
    0 references
    combinatorial optimization
    0 references
    OpenAlex ID
    W2023030534
    0 references
    arXiv ID
    1108.0342
    0 references
     
    Retrieved from "https://portal.mardi4nfdi.de/w/index.php?title=Item:Q1935820&oldid=33429617"
    Powered by MediaWiki