Article ID Journal Published Year Pages File Type
430977 Journal of Discrete Algorithms 2007 8 Pages PDF
Abstract

We give a new proof of the NP-hardness of deciding the existence of real roots of an integer univariate polynomial encoded by a straight line program based on certain properties of the Tchebychev polynomials. These techniques allow us to prove some new NP-hardness results related to real root approximation for polynomials given by straight line programs.

Keywords
Related Topics
Physical Sciences and Engineering Computer Science Computational Theory and Mathematics
Preview
Real roots of univariate polynomials and straight line programs
Authors
, ,