Ranking-based black-box complexity (Q528852)

From MaRDI portal
Revision as of 19:33, 13 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
Ranking-based black-box complexity
scientific article

    Statements

    title
    Ranking-based black-box complexity (English)
    0 references
    author
    Benjamin Doerr
    0 references
    Carola Winzen
    0 references
    published in
    Algorithmica
    0 references
    publication date
    17 May 2017
    0 references
    zbMATH Keywords
    query complexity
    0 references
    theory of randomized search heuristics
    0 references
    mastermind
    0 references
    black-box complexity
    0 references

    Identifiers

    Mathematics Subject Classification ID
    68Q25
    0 references
    68T20
    0 references
    68W20
    0 references
    90C59
    0 references
    zbMATH DE Number
    6718305
    0 references
    OpenAlex ID
    W3100828115
    0 references
    arXiv ID
    1102.1140
    0 references
     
    Retrieved from "https://portal.mardi4nfdi.de/w/index.php?title=Item:Q528852&oldid=36321927"
    Powered by MediaWiki