Sequential and parallel complexity of approximate evaluation of polynomial zeros
- 1 January 1987
- journal article
- Published by Elsevier in Computers & Mathematics with Applications
- Vol. 14 (8) , 591-622
- https://doi.org/10.1016/0898-1221(87)90186-6
Abstract
No abstract availableKeywords
This publication has 17 references indexed in Scilit:
- Complexity of parallel matrix computationsTheoretical Computer Science, 1987
- Efficient parallel solutions to some geometric problemsJournal of Parallel and Distributed Computing, 1986
- Quasi-GCD computationsJournal of Complexity, 1985
- On the efficiency of algorithms of analysisBulletin of the American Mathematical Society, 1985
- Fast algorithms for the characteristics polynomialTheoretical Computer Science, 1985
- Parallel computation for well-endowed rings and space-bounded probabilistic machinesInformation and Control, 1983
- Fast parallel matrix and GCD computationsInformation and Control, 1982
- The fundamental theorem of algebra and complexity theoryBulletin of the American Mathematical Society, 1981
- Power Sum Method and the Approximative Solution of Algebraic EquationsMathematics of Computation, 1975
- A Machine Method for Solving Polynomial EquationsJournal of the ACM, 1961