The Query Complexity of Finding a Hidden Permutation (Q2848962): Difference between revisions

From MaRDI portal
Added link to MaRDI item.
ReferenceBot (talk | contribs)
Changed an Item
 
(4 intermediate revisions by 3 users not shown)
Property / author
 
Property / author: Manindra Agrawal / rank
Normal rank
 
Property / author
 
Property / author: Manindra Agrawal / rank
 
Normal rank
Property / MaRDI profile type
 
Property / MaRDI profile type: MaRDI publication profile / rank
 
Normal rank
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 21:33, 6 July 2024

scientific article
Language Label Description Also known as
English
The Query Complexity of Finding a Hidden Permutation
scientific article

    Statements