Query complexity of mastermind variants (Q1690229): Difference between revisions

From MaRDI portal
Added link to MaRDI item.
ReferenceBot (talk | contribs)
Changed an Item
 
(3 intermediate revisions by 3 users not shown)
Property / MaRDI profile type
 
Property / MaRDI profile type: MaRDI publication profile / rank
 
Normal rank
Property / OpenAlex ID
 
Property / OpenAlex ID: W2963057655 / rank
 
Normal rank
Property / arXiv ID
 
Property / arXiv ID: 1607.04597 / 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: Improved Approximation Algorithm for the Number of Queries Necessary to Identify a Permutation / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q5731202 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4457558 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4660333 / rank
 
Normal rank
Property / cites work
 
Property / cites work: On the algorithmic complexity of the Mastermind game with black-peg results / rank
 
Normal rank
Property / cites work
 
Property / cites work: Optimal reconstruction of graphs under the additive model / rank
 
Normal rank
Property / cites work
 
Property / cites work: The number of pessimistic guesses in generalized black-peg mastermind / rank
 
Normal rank
Property / cites work
 
Property / cites work: The worst case number of questions in generalized AB game with and without white-peg answers / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4132291 / rank
 
Normal rank
Property / cites work
 
Property / cites work: On the number of queries necessary to identify a permutation / rank
 
Normal rank
Property / cites work
 
Property / cites work: On the query complexity of black-peg AB-mastermind / rank
 
Normal rank

Latest revision as of 23:21, 14 July 2024

scientific article
Language Label Description Also known as
English
Query complexity of mastermind variants
scientific article

    Statements

    Identifiers

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