Computing at Least One of Two Roots of a Polynomial Is, in General, Not Algorithmic

Authors

Vladik Kreinovich, The University of Texas at El PasoFollow

Publication Date

6-2007

Comments

Technical Report: UTEP-CS-07-37

Abstract

In our previous work, we provided a theoretical explanation for an empirical fact that it is easier to find a unique root than the multiple roots. In this short note, we strengthen that explanation by showing that finding one of many roots is also difficult.