scientific article; zbMATH DE number 1157659
From MaRDI portal
Publication:4391224
zbMath0900.12001MaRDI QIDQ4391224
No author found.
Publication date: 1 October 1998
Title: zbMATH Open Web Interface contents unavailable due to conflicting licenses.
Symbolic computation and algebraic computation (68W30) Parallel algorithms in computer science (68W10) Polynomials in real and complex fields: location of zeros (algebraic theorems) (12D10)
Related Items (20)
On the Davenport-Mahler bound ⋮ Continuous amortization and extensions: with applications to bisection-based root isolation ⋮ Near optimal subdivision algorithms for real root isolation ⋮ A symbolic-numerical algorithm for isolating real roots of certain radical expressions ⋮ Separation bounds for polynomial systems ⋮ Nearly optimal refinement of real roots of a univariate polynomial ⋮ Quality of positive root bounds ⋮ On the computing time of the continued fractions method ⋮ SqFreeEVAL: An (almost) optimal real-root isolation algorithm ⋮ New bounds for the Descartes method ⋮ On the maximum computing time of the bisection method for real root isolation ⋮ From approximate factorization to root isolation with application to cylindrical algebraic decomposition ⋮ Univariate real root isolation in an extension field and applications ⋮ Real solution isolation with multiplicity of zero-dimensional triangular systems ⋮ Complexity in iteration of polynomials ⋮ Exact, efficient, and complete arrangement computation for cubic curves ⋮ On the Complexity of Reliable Root Approximation ⋮ Generic computation of the real closure of an ordered field. ⋮ An efficient method for analyzing the topology of plane real algebraic curves. ⋮ Krandick's proof of Lagrange's real root bound claim
This page was built for publication:
