Skip to main content
SpringerLink
Log in

Rapid parallel calculation of degrees in a quotient ring of polynomials over a finite field

  • Published:
Mathematical notes of the Academy of Sciences of the USSR Aims and scope Submit manuscript

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

Access this article

Log in via an institution

Price excludes VAT (USA)
Tax calculation will be finalised during checkout.

Instant access to the full article PDF.

Institutional subscriptions

Literature cited

  1. A. O. Slisenko, “Complexity problems of computational theory,” Usp. Mat. Nauk,36, No. 6, 21–103 (1981).

    Google Scholar 

  2. V. N. Faddeeva and D. K. Faddeev, “Parallel calculations in linear algebra,” Kibernetika,13, No. 6, 28–40 (1977).

    Google Scholar 

  3. V. N. Faddeeva and D. K. Faddeev, “Parallel calculations in linear algebra. II,” Kinernetika,18, No. 3, 18–31 (1982).

    Google Scholar 

  4. V. I. Solodovnikov, “Upper bounds of complexity of the solution of systems of linear equations,” in: The Theory of Complexity of Computations. I, J. Sov. Math.,29, No. 4 (1985).

  5. D. Knuth, The Art of Computer Programming, Vol. 2, Addison-Wesley, Reading, Massachusetts-London (1969).

    Google Scholar 

  6. A. Aho, J. E. Hopcraft, and J. D. Ullman, The Design and Analysis of Computer Algorithms, Addison-Wesley, Reading, Massachusetts-London (1975).

    Google Scholar 

  7. D. E. Heller, “A survey of parallel algorithms in numerical linear algebra,” SIAM Rev.,20, No. 4, 740–777 (1978).

    Google Scholar 

  8. D. Coppersmith and S. Winograd, “On the asymptotic complexity of matrix multiplication,” SIAM J. Comput.,11, No. 3, 472–492 (1982).

    Google Scholar 

  9. V. Pan, How to Multiply Matrices Faster, Lecture Notes in Computer Science, 179, Springer-Verlag, Berlin-New York (1984).

    Google Scholar 

  10. S. J. Berkowitz, “On computing the determinant in small parallel time using a small number of processors,” Inform Process. Lett.,18, No. 3, 147–150 (1984).

    Google Scholar 

  11. J. Reif, “Logarithmic depth circuits for algebraic functions,” 24th Annu. Symp. Found. Comput. Sci., Tuscon, Arizona, November 7–9, 1983. Silver Spring, Maryland (1983), pp. 138–145.

    Google Scholar 

Download references

Authors
  1. P. N. Golovanov
    View author publications

    You can also search for this author in PubMed Google Scholar

  2. V. I. Solodovnikov
    View author publications

    You can also search for this author in PubMed Google Scholar

Additional information

Translated from Matematicheskie Zametki, Vol. 42, No. 6, pp. 886–894, December, 1987.

Rights and permissions

Reprints and permissions

About this article

Cite this article

Golovanov, P.N., Solodovnikov, V.I. Rapid parallel calculation of degrees in a quotient ring of polynomials over a finite field. Mathematical Notes of the Academy of Sciences of the USSR 42, 987–992 (1987). https://doi.org/10.1007/BF01137457

Download citation

  • Received:

  • Issue Date:

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

Keywords

Search

Navigation