Real roots of univariate polynomials and straight line programs
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 approx...
| Autores: | , |
|---|---|
| Tipo de recurso: | artículo |
| Estado: | Versión publicada |
| Fecha de publicación: | 2007 |
| País: | Argentina |
| Institución: | Universidad Nacional de Buenos Aires. Facultad de Ciencias Exactas y Naturales |
| Repositorio: | Biblioteca Digital (UBA-FCEN) |
| Idioma: | inglés |
| OAI Identifier: | paperaa:paper_15708667_v5_n3_p471_Perrucci |
| Acceso en línea: | http://hdl.handle.net/20.500.12110/paper_15708667_v5_n3_p471_Perrucci |
| Access Level: | acceso abierto |
| Palabra clave: | Complexity Real roots Straight line program Approximation theory Computational complexity Integer programming Problem solving Polynomials |
| Sumario: | 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. © 2006 Elsevier B.V. All rights reserved. |
|---|