80 search results - page 2 / 16 » On the Complexity of Real Root Isolation |
CASC
2009
Springer
15 years 4 months ago
2009
Springer
This work addresses the problem of computing a certified ǫ-approximation of all real roots of a square-free integer polynomial. We proof an upper bound for its bit complexity, b...
78
Voted
ISSAC
2009
Springer
15 years 4 months ago
2009
Springer
CORR
2011
Springer
14 years 5 months ago
2011
Springer
Let f be a univariate polynomial with real coefficients, f ∈ R[X]. Subdivision algorithms based on algebraic techniques (e.g., Sturm or Descartes methods) are widely used for is...
MICS
2007
14 years 9 months ago
2007
A new algorithm for real root isolation of univariate polynomials is proposed, which is mainly based on exact interval arithmetic and bisection method. Although exact interval arit...
71
Voted
DAGSTUHL
2008
14 years 11 months ago
2008
Abstract. We present algorithmic, complexity and implementation results concerning real root isolation of a polynomial of degree d, with integer coefficients of bit size , using S...