Funder
National Science Foundation
Yale University
Subject
Discrete Mathematics and Combinatorics,Theoretical Computer Science
Reference15 articles.
1. N.H. Bshouty, Optimal algorithms for the coin weighing problem with a spring scale, in: COLT, Vol. 1, 2009.
2. Finding a hidden code by asking questions;Chen;Comput. Combin.,1996
3. Mastermind;Chvátal;Combinatorica,1983
4. B. Doerr, R. Spöhel, H. Thomas, C. Winzen, Playing mastermind with many colors, in: Proceedings of the Twenty-Fourth Annual ACM-SIAM Symposium on Discrete Algorithms, 2013, pp. 695–704.
5. M. El Ouali, V. Sauerland, Improved approximation algorithm for the number of queries necessary to identify a permutation, in: International Workshop on Combinatorial Algorithms, 2013, pp. 443–447.
Cited by
3 articles.
订阅此论文施引文献
订阅此论文施引文献，注册后可以免费订阅5篇论文的施引文献，订阅后可以查看论文全部施引文献