Fast parallel matrix and GCD computations
- 1 March 1982
- journal article
- Published by Elsevier in Information and Control
- Vol. 52 (3) , 241-256
- https://doi.org/10.1016/s0019-9958(82)90766-5
Abstract
No abstract availableKeywords
This publication has 8 references indexed in Scilit:
- The complexity of partial derivativesTheoretical Computer Science, 1983
- The maximum flow problem is log space complete for PTheoretical Computer Science, 1982
- A note on the parallel complexity of computing the rank of order n matricesInformation Processing Letters, 1980
- Probabilistic Algorithms in Finite FieldsSIAM Journal on Computing, 1980
- Fast Parallel Matrix Inversion AlgorithmsSIAM Journal on Computing, 1976
- Factoring polynomials over large finite fieldsMathematics of Computation, 1970
- Systems of distinct representatives and linear algebraJournal of Research of the National Bureau of Standards Section B Mathematics and Mathematical Physics, 1967
- The probability that a determinant be congruent to 𝑎(\bmod𝑚)Bulletin of the American Mathematical Society, 1944