On the number of queries necessary to identify a permutation
- 1 December 1986
- journal article
- Published by Elsevier in Journal of Algorithms
- Vol. 7 (4) , 449-462
- https://doi.org/10.1016/0196-6774(86)90013-1
Abstract
No abstract availableKeywords
This publication has 6 references indexed in Scilit:
- The Information-Theoretic Bound is Good for MergingSIAM Journal on Computing, 1984
- MastermindCombinatorica, 1983
- Writing a computer program to play Mastermind that appears to be intelligentACM SIGART Bulletin, 1983
- An algorithm to play the game of mastermindACM SIGART Bulletin, 1982
- The Ford-Johnson Sorting Algorithm Is Not OptimalJournal of the ACM, 1979
- The complexity of computing the permanentTheoretical Computer Science, 1979