Computing the Degree of Black-Box Polynomials, with Applications
摘要
This note presents simple techniques to recover the total degree of a black-box polynomial and the value of its leading coefficients, relying only on few evaluations of the polynomial or its derivatives, the knowledge of basic bounds for the size of the coefficients, and classical properties of complex-valued polynomials. We apply the techniques to discrete optimization problems.