Specified precision polynomial root isolation is in NC
- 4 December 2002
- proceedings article
- Published by Institute of Electrical and Electronics Engineers (IEEE)
- p. 152-162
- https://doi.org/10.1109/fscs.1990.89534
Abstract
No abstract availableThis publication has 15 references indexed in Scilit:
- Specified precision polynomial root isolation is in NCPublished by Institute of Electrical and Electronics Engineers (IEEE) ,2002
- Simple algorithms for approximating all roots of a polynomial with real rootsJournal of Complexity, 1990
- On the Worst-Case Arithmetic Complexity of Approximating Zeros of Systems of PolynomialsSIAM Journal on Computing, 1989
- Some algebraic and geometric computations in PSPACEPublished by Association for Computing Machinery (ACM) ,1988
- Representations and Parallel Computations for Rational FunctionsSIAM Journal on Computing, 1986
- On the cost of approximating all roots of a complex polynomialMathematical Programming, 1985
- Fast and efficient algorithms for sequential and parallel evaluation of polynomial zeros and of matrix polynomialsPublished by Institute of Electrical and Electronics Engineers (IEEE) ,1985
- Parallel Algorithms for Algebraic ProblemsSIAM Journal on Computing, 1984
- Fast parallel matrix and GCD computationsPublished by Institute of Electrical and Electronics Engineers (IEEE) ,1982
- Subresultants and Reduced Polynomial Remainder SequencesJournal of the ACM, 1967