The query complexity of a permutation-based variant of mastermind (Q1741495)

From MaRDI portal
Revision as of 04:20, 19 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
The query complexity of a permutation-based variant of mastermind
scientific article

    Statements

    The query complexity of a permutation-based variant of mastermind (English)
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    3 May 2019
    0 references
    0 references
    0 references
    0 references
    0 references
    query complexity
    0 references
    hidden permutation
    0 references
    black-box complexity
    0 references
    \textsc{LeadingOnes}
    0 references
    0 references
    0 references