Integer Arithmetic Algorithms for Polynomial Real Zero Determination
From MaRDI portal
Publication:5633582
DOI10.1145/321662.321667zbMath0226.65039OpenAlexW1970836040MaRDI QIDQ5633582
Publication date: 1971
Published in: Journal of the ACM (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1145/321662.321667
Related Items
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, Semantics of computable physical models, An implementation of Vincent's theorem, Decision problem for a class of univariate Pfaffian functions, 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, Deciding consistency of systems of exponential-polynomial inequalities in subexponential time, Computational aspects of deciding if all roots of a polynomial lie within the unit circle, Complexity of deciding the first-order theory of real closed fields, Zero counting for a class of univariate Pfaffian functions, On the forgotten theorem of Mr. Vincent, On the solution of polynomial equations using continued fractions, Complexity of deciding Tarski algebra, On the Piano Movers problem. II: General techniques for computing topological properties of real algebraic manifolds, An efficient method for analyzing the topology of plane real algebraic curves., Polynomial real root approximation using continued fractions, Congruence arithmetic algorithms for polynomial real zero determination, Solving systems of polynomial inequalities over a real closed field in subexponential time, The Minimum Root Separation of a Polynomial
