Reducing the arity in unbiased black-box complexity (Q2251000)

From MaRDI portal
Revision as of 18:27, 8 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
Reducing the arity in unbiased black-box complexity
scientific article

    Statements

    Reducing the arity in unbiased black-box complexity (English)
    0 references
    0 references
    0 references
    10 July 2014
    0 references
    0 references
    0 references
    0 references
    0 references
    black-box complexity
    0 references
    running time analysis
    0 references
    theory of randomized search heuristics
    0 references
    0 references
    0 references