The Query Complexity of Finding a Hidden Permutation (Q2848962): Difference between revisions
From MaRDI portal
Set profile property. |
ReferenceBot (talk | contribs) Changed an Item |
||
(One intermediate revision by one other user not shown) | |||
Property / OpenAlex ID | |||
Property / OpenAlex ID: W1526420097 / rank | |||
Normal rank | |||
Property / cites work | |||
Property / cites work: Q4132291 / rank | |||
Normal rank | |||
Property / cites work | |||
Property / cites work: Mastermind / 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: Searching games with errors -- fifty years of coping with liars / rank | |||
Normal rank | |||
Property / cites work | |||
Property / cites work: Randomization, derandomization and antirandomization: Three games / rank | |||
Normal rank | |||
Property / cites work | |||
Property / cites work: Playing Mastermind With Many Colors / rank | |||
Normal rank |
Latest revision as of 20:33, 6 July 2024
scientific article
Language | Label | Description | Also known as |
---|---|---|---|
English | The Query Complexity of Finding a Hidden Permutation |
scientific article |
Statements
The Query Complexity of Finding a Hidden Permutation (English)
0 references
13 September 2013
0 references