Integer Arithmetic Algorithms for Polynomial Real Zero Determination

Cited in

(25)

Some parallel methods for polynomial root-finding
Computer algebra: Past and future
Computer algebra applied to itself
Solving systems of polynomial inequalities in subexponential time
The fastest exact algorithms for the isolation of the real roots of a polynomial equation
An implementation of Vincent's theorem
Vincent's forgotten theorem, its extension and application
Exact algorithms for polynomial real root approximation using continued fractions
Trigonometric polynomials with simple roots
The complexity of deciding consistency of systems of polynomials in exponent inequalities
Computational aspects of deciding if all roots of a polynomial lie within the unit circle
On the forgotten theorem of Mr. Vincent
On the solution of polynomial equations using continued fractions
Complexity of deciding Tarski algebra
An efficient method for analyzing the topology of plane real algebraic curves.
Congruence arithmetic algorithms for polynomial real zero determination
Complexity of deciding the first-order theory of real closed fields
Polynomial real root approximation using continued fractions
The Minimum Root Separation of a Polynomial
Zero counting for a class of univariate Pfaffian functions
Semantics of computable physical models
Decision problem for a class of univariate Pfaffian functions
Deciding consistency of systems of exponential-polynomial inequalities in subexponential time
On the Piano Movers problem. II: General techniques for computing topological properties of real algebraic manifolds
Solving systems of polynomial inequalities over a real closed field in subexponential time

This page was built for publication: Integer Arithmetic Algorithms for Polynomial Real Zero Determination

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q5633582)