Abstract
We study the problem of finding a hidden code k in the domain {1, ..., m}n in the presence of an oracle which, for any x in the domain, answers a pair of numbers a(x,k) and b(x,k) such that a(x,k) is the number of components coinciding in x and k and, b(x, k) is the sum of a(x, k) and the number of components occurring in both x and k but, not at the same position. We show that ⌈m/n⌉+ 2nlogn + 2n + 2 queries are sufficient to find any hidden code if m ≥ n.
Cite
CITATION STYLE
Chen, Z., Cunha, C., & Homer, S. (1996). Finding a hidden code by asking questions. In Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics) (Vol. 1090, pp. 50–55). Springer Verlag. https://doi.org/10.1007/3-540-61332-3_138
Register to see more suggestions
Mendeley helps you to discover research relevant for your work.
