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

Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)

Volumn 199 LNCS, Issue , 1985, Pages 63-69

  Chistov, A L ^a  

^a ST PETERSBURG INSTITUTE FOR INFORMATICS AND AUTOMATION   (Russian Federation)

Author keywords

[No Author keywords available]

Indexed keywords

EID: 85034440079     PISSN: 03029743     EISSN: 16113349     Source Type: Book Series    
DOI: 10.1007/BFb0028792     Document Type: Conference Paper

References (10)

1. Aho A., Hopcroft J., Ullman J., The design and analysis of computer algorithms. -Addison Wesley, 1976.
2. Borodin A., von zur Gathen J., Hopcroft J. Past parallel matrix and GOD computations. -Information, and Control, 1982, vol.52, no.3, p.241-256.
3. Chistov A.L., Grigoriev D.Y.U. Polynomial-time factoring of the multivariable polynomials over a global field. -LOMI preprint E-5-82, Leningrad, 1982.
4. Chistov A.L., Grigoriev D.Y.U. Subexponetial-time solving systems of algebraic equations. I, II. -LOMI preprints E-9-83, E-10-83, Leningrad, 1983.
5. Csanky L. Past parallel matrix inversion algorithms. -SIAM J. Computing, 1976, vol. 5, no.41, p.618-623.
6. Fortune S., Wyllie J., Parallelism in random access machines. -Proc. 10th ACM Symposium on Theory of Computing, San Diego, California 1978, p.114-118.
7. Heintz J. Definability and fast quantifier elimination, in algebraically closed field. -Preprint Univ.Frankfurt, West Germany, 1981.
8. Hyafil L. On the parallel evaluation of multivariable polynomials. SIAM J.Comput., 1979, vol.3, no.2, p.120-123.
9. Ibarra O., Moran S., Rosier L.E., A note on the parallel complexity of computing the rank of order n matrices. -Information. Processing Letters, 1980, vol.11, p.162.
10. Valiant L.G., Skyum S. Past parallel computation of polynomials using few processors. -Lecture Notes in Computer Science, 1981, vol.118, p.132-139.