When Newton meets Descartes: a simple and fast algorithm to isolate the real roots of a polynomial.

Michael Sagraloff

Published in: ISSAC (2012)

Keyphrases

worst case
np hard
computational complexity
data sets
preprocessing
cost function
computational cost
high accuracy
segmentation algorithm
detection algorithm
improved algorithm
semidefinite programming
polynomially bounded