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.

错误:搜索内容不能为空,请输入英文关键词
错误:关键词超出字数限制,请精简
高级检索

Computing the Degree of Black-Box Polynomials, with Applications

  • Eduardo S. Zeron,
  • Jesús A. De Loera

摘要

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.