Fast parallel calculation of the rank of matrices over a field of arbitrary characteristic

[1]  Joos Heintz,et al.  Corrigendum: Definability and Fast Quantifier Elimination in Algebraically Closed Fields , 1983, Theor. Comput. Sci..

[2]  Leslie G. Valiant,et al.  Fast Parallel Computation of Polynomials Using Few Processors , 1983, SIAM J. Comput..

[3]  Allan Borodin,et al.  Fast parallel matrix and GCD computations , 1982, 23rd Annual Symposium on Foundations of Computer Science (sfcs 1982).

[4]  Leslie G. Valiant,et al.  Fast Parallel Computation of Polynomials Using Few Processes , 1981, MFCS.

[5]  Oscar H. Ibarra,et al.  A Note on the Parallel Complexity of Computing the Rank of Order n Matrices , 1980, Inf. Process. Lett..

[6]  Laurent Hyafil,et al.  On the parallel evaluation of multivariate polynomials , 1978, SIAM J. Comput..

[7]  Steven Fortune,et al.  Parallelism in random access machines , 1978, STOC.

[8]  L. Csanky,et al.  Fast parallel matrix inversion algorithms , 1975, 16th Annual Symposium on Foundations of Computer Science (sfcs 1975).

[9]  Alfred V. Aho,et al.  The Design and Analysis of Computer Algorithms , 1974 .