Real roots of univariate polynomials and straight line programs

Authors:
Daniel Perrucci;Juan Sabia
Affiliations:
Departamento de Matemática, FCEN, Universidad de Buenos Aires, Ciudad Universitaria, 1428 Buenos Aires, Argentina and CONICET, Argentina;Departamento de Matemática, FCEN, Universidad de Buenos Aires, Ciudad Universitaria, 1428 Buenos Aires, Argentina and Departamento de Ciencias Exactas, CBC, Universidad de Buenos Aires, Ciuda ...
Venue:
Journal of Discrete Algorithms
Year:
2007

Citing 3
Cited 0

Numerical analysis: mathematics of scientific computing

Numerical analysis: mathematics of scientific computing
On the rapid computation of various polylogarithmic constants

Mathematics of Computation
Computers and Intractability: A Guide to the Theory of NP-Completeness

Computers and Intractability: A Guide to the Theory of NP-Completeness

Quantified Score

Hi-index	0.00

Visualization

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.