Complexity of parallel matrix computations
Author:
- Victor PanVPVictor Pan
- 1 September 1987
- journal article
- Published by Elsevier in Theoretical Computer Science
- Vol. 54 (1) , 65-85
Abstract
No abstract availableKeywords
This publication has 12 references indexed in Scilit:
- Matching is as easy as matrix inversionCombinatorica, 1987
- Algebraic complexity of computing polynomial zerosComputers & Mathematics with Applications, 1987
- Fast parallel orthogonalizationACM SIGACT News, 1986
- Fast algorithms for the characteristics polynomialTheoretical Computer Science, 1985
- Improved processor bounds for algebraic and combinatorial problems in RNC1985
- The complexity of partial derivativesTheoretical Computer Science, 1983
- Fast parallel matrix and GCD computationsInformation and Control, 1982
- Fast algorithms for rational Hermite approximation and solution of Toeplitz systemsIEEE Transactions on Circuits and Systems, 1979
- An improved parallel processor bound in fast matrix inversionInformation Processing Letters, 1978
- Fast Parallel Matrix Inversion AlgorithmsSIAM Journal on Computing, 1976