AI helps you reading Science
A PTAS for the minimization of polynomials of fixed degree over the simplex
Theor. Comput. Sci., no. 2 (2006): 210-225
EI
Full Text
Keywords
Abstract
We consider the problem of computing the minimum value pmin taken by a polynomial p(x) of degree d over the standard simplex Δ. This is an NP-hard problem already for degree d = 2. For any integer k ≥ 1, by minimizing p(x) over the set of rational points in Δ with denominator k, one obtains a hierarchy of upper bounds pΔ(k) converging to ...More
Code:
Data:
Tags
Comments
数据免责声明
页面数据均来自互联网公开来源、合作出版商和通过AI技术自动分析结果,我们不对页面数据的有效性、准确性、正确性、可靠性、完整性和及时性做出任何承诺和保证。若有疑问,可以通过电子邮件方式联系我们:report@aminer.cn