Guessing secrets with inner product questions

Proceedings of the Annual ACM-SIAM Symposium on Discrete Algorithms

Volumn 06-08-January-2002, Issue , 2002, Pages 247-253

  Chung, Fan ^a   Graham, Ronald ^a   Lu, Linyuan ^a  

^a UNIVERSITY OF CALIFORNIA   (United States)

Author keywords

[No Author keywords available]

Indexed keywords

OPTIMAL SYSTEMS; POLYNOMIAL APPROXIMATION;

AMOUNT OF INFORMATION; GUESSING SECRETS; INNER PRODUCT; OPTIMAL STRATEGIES; POLYNOMIAL-TIME ALGORITHMS;

ALGORITHMS;

EID: 84968796719     PISSN: None     EISSN: None     Source Type: Conference Proceeding    
DOI: None     Document Type: Conference Paper

References (3)

1. F. Chung, R. Graham and F. T. Leighton, Guessing Secrets (Extended Abstract), Proceedings of the Twelfth Annual ACM-SIAM Symposium on Discrete Algorithms (2001), 723-726.
2. F. Chung, R. Graham and F. T. Leighton, Guessing secrets, Electronic Journal of Combinatorics 8 (2001), #R13.
3. M. R. Gaxey and D. S. Johnson, Computer and Intractability, A Guide to the Theory of NP-completeness, W. H. Freeman and Co., San Francisco, 1979.