The query complexity of a permutation-based variant of mastermind (Q1741495): Difference between revisions

From MaRDI portal
Importer (talk | contribs)
Changed an Item
ReferenceBot (talk | contribs)
Changed an Item
Property / cites work
 
Property / cites work: The Query Complexity of Finding a Hidden Permutation / rank
 
Normal rank
Property / cites work
 
Property / cites work: Mastermind / rank
 
Normal rank
Property / cites work
 
Property / cites work: Playing Mastermind With Many Colors / rank
 
Normal rank
Property / cites work
 
Property / cites work: Faster black-box algorithms through higher arity operators / rank
 
Normal rank
Property / cites work
 
Property / cites work: The \((1+1)\) elitist black-box complexity of LeadingOnes / rank
 
Normal rank
Property / cites work
 
Property / cites work: On the analysis of the \((1+1)\) evolutionary algorithm / rank
 
Normal rank
Property / cites work
 
Property / cites work: Upper and lower bounds for randomized search heuristics in black-box optimization / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q5731202 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Black-box search by unbiased variation / rank
 
Normal rank
Property / cites work
 
Property / cites work: The Complexity of Enumeration and Reliability Problems / rank
 
Normal rank

Revision as of 03:20, 19 July 2024

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
    query complexity
    0 references
    hidden permutation
    0 references
    black-box complexity
    0 references
    \textsc{LeadingOnes}
    0 references

    Identifiers

    0 references
    0 references
    0 references
    0 references
    0 references
    0 references