A fast parallel algorithm to compute the rank of a matrix over an arbitrary field
Author:
- 1 March 1987
- journal article
- Published by Springer Nature in Combinatorica
- Vol. 7 (1) , 101-104
Abstract
No abstract availableKeywords
This publication has 7 references indexed in Scilit:
- Fast parallel computation with permutation groups1985
- On computing the determinant in small parallel time using a small number of processorsInformation Processing Letters, 1984
- The parallel complexity of the abelian permutation group membership problem1983
- Parallel computation for well-endowed rings and space-bounded probabilistic machinesInformation and Control, 1983
- Fast parallel matrix and GCD computationsInformation and Control, 1982
- A note on the parallel complexity of computing the rank of order n matricesInformation Processing Letters, 1980
- Fast Parallel Matrix Inversion AlgorithmsSIAM Journal on Computing, 1976