Academia.eduAcademia.edu
paper cover icon
Guessing secrets

Guessing secrets

ACM-SIAM Symposium on Discrete Algorithms, 2001
Abstract
Suppose we are given some xed (but unknown) subset X of a set , and our object is to learn as much as possible about the elements of X by asking binary questions. Specically, each question is just a function F : !f 0; 1g ,a nd the answer to F is just the value F (Xi )f orsome Xi2

Ronald Graham hasn't uploaded this paper.

Create a free Academia account to let Ronald know you want this paper to be uploaded.

Ask for this paper to be uploaded.