Skip to main content
SpringerLink
Log in

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

  • Conference paper
  • First Online:
Fundamentals of Computation Theory (FCT 1985)

Part of the book series: Lecture Notes in Computer Science ((LNCS,volume 199))

Included in the following conference series:

This is a preview of subscription content, log in via an institution to check access.

Access this chapter

Log in via an institution

Institutional subscriptions

Preview

Unable to display preview. Download preview PDF.

Unable to display preview. Download preview PDF.

References

  1. Aho A., Hopcroft J., Ullman J. The design and analysis of computer algorithms. — Addison Wesley, 1976.

    Google Scholar 

  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.

    Google Scholar 

  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.

    Google Scholar 

  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.

    Google Scholar 

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

    Google Scholar 

  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.

    Google Scholar 

  7. Heintz J. Definability and fast quantifier elimination in algebraically closed field. — Preprint Univ.Frankfurt, West Germany, 1981.

    Google Scholar 

  8. Hyafil L. On the parallel evaluation of multivariable polynomials. SIAM J.Comput., 1979, vol.3, no.2, p.120–123.

    Google Scholar 

  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.

    Google Scholar 

  10. Valiant L.G., Skyum S. Fast parallel computation of polynomials using few processors. — Lecture Notes in Computer Science, 1981, vol.118, p.132–139.

    Google Scholar 

Download references

Author information

Authors and Affiliations

  1. Leningrad Research Computer Center, USSR Academy of Sciences, Mendelevskaya 1, 199164, Leningrad, USSR

    A. L. Chistov

Authors
  1. A. L. Chistov
    View author publications

    You can also search for this author in PubMed Google Scholar

Editor information

Lothar Budach

Rights and permissions

Reprints and permissions

Copyright information

© 1985 Springer-Verlag Berlin Heidelberg

About this paper

Cite this paper

Chistov, A.L. (1985). Fast parallel calculation of the rank of matrices over a field of arbitrary characteristic. In: Budach, L. (eds) Fundamentals of Computation Theory. FCT 1985. Lecture Notes in Computer Science, vol 199. Springer, Berlin, Heidelberg. https://doi.org/10.1007/BFb0028792

Download citation

  • DOI: https://doi.org/10.1007/BFb0028792

  • Published:

  • Publisher Name: Springer, Berlin, Heidelberg

  • Print ISBN: 978-3-540-15689-5

  • Online ISBN: 978-3-540-39636-9

  • eBook Packages: Springer Book Archive

Publish with us

Policies and ethics

Search

Navigation