Fast parallel calculation of the rank of matrices over a field of arbitrary characteristic-Reference-Cited by-同舟云学术

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

Published: Issue: Volume: Page:63-69
ISSN:
Container-title:Fundamentals of Computation Theory
language:
Short-container-title:

Author:

Chistov A. L.

Publisher

Springer-Verlag

Link

http://link.springer.com/content/pdf/10.1007/BFb0028792.pdf

Reference10 articles.

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. Fast parallel matrix and GCD computations. — Information and Control, 1982, vol.52, no.3, p.241–256.

3. Chistov A.L., Grigoriev D.Yu. Polynomial-time factoring of the multivariable polynomials over a global field. — LOMI preprint E-5-82, Leningrad, 1982.

4. Chistov A.L., Grigoriev D.Yu. Subexponetial-time solving systems of algebraic equations. I,II. — LOMI preprints E-9-83, E-10-83, Leningrad, 1983.

5. Csanky L. Fast parallel matrix inversion algorithms. — SIAM J. Computing, 1976, vol.5, no.4, p.618–623.

Cited by 18 articles. 订阅此论文施引文献订阅此论文施引文献，注册后可以免费订阅5篇论文的施引文献，订阅后可以查看论文全部施引文献

1. Lower bounds for the rank of a matrix with zeros and ones outside the leading diagonal;Программирование;2024-04-15

2. Lower Bounds for the Rank of a Matrix with Zeros and Ones outside the Leading Diagonal;Programming and Computer Software;2024-04

3. Effective Lower Bounds on the Matrix Rank and Their Applications;Programming and Computer Software;2023-10

4. Effective Lower Bounds on the Matrix Rank and Their Applications;Программирование;2023-09-01

5. Generalization of the Subset Sum Problem and Cubic Forms;Computational Mathematics and Mathematical Physics;2023-01