- Alice chooses a secret polynomial p(x) with nonnegative integer coefficients. Bob wants to discover this polynomial by querying Alice for the value of p(x) for some integer x of Bob’s choice. What is the minimal number of queries Bob needs to determine p(x) exactly? Answer: Two http://jeremykun.com/2014/11/18/learning-a-single-variable-polynomial-or-the-power-of-adaptive-queries/ 83 comments math
Linking pages
Related searches:
Search whole site: site:jeremykun.com
Search title: Learning a single-variable polynomial, or the power of adaptive queries – Math ∩ Programming
See how to search.