Advertisement

On bilinear algorithms over fields of different characteristics

  • V. V. Lysikov
Article
  • 35 Downloads

Abstract

Relationship between bilinear algorithms over fields of different characteristics and over different rings is investigated.

Keywords

algebraic complexity theory bilinear algorithms 

Preview

Unable to display preview. Download preview PDF.

Unable to display preview. Download preview PDF.

References

  1. 1.
    A. Schönhage, “Partial and total matrix multiplication,” SIAM J. Comput. 10, 434–455 (1981).MathSciNetCrossRefMATHGoogle Scholar
  2. 2.
    T. D. Howell, “Global properties of tensor rank,” Linear Algebr. Appl. 22(3), 9–23 (1978).MathSciNetCrossRefMATHGoogle Scholar
  3. 3.
    V. Strassen, “Relative bilinear complexity and matrix multiplication,” J. Reine Angew. Math. 375/376, 406–443 (1987).MathSciNetGoogle Scholar
  4. 4.
    N. Bourbaki, Algébre. Chapitres 1 a 3 (H. Hermann Co, Paris, 1970; Fizmatgiz, Moscow, 1962).MATHGoogle Scholar
  5. 5.
    A. Robinson, On the Metamathematics of Algebra (North-Holland, Amsterdam, 1951).MATHGoogle Scholar
  6. 6.
    D. Marker, M. Messmer, and A. Pillay, Model Theory of Fields (Springer-Verlag, Berlin, 1996).CrossRefMATHGoogle Scholar

Copyright information

© Allerton Press, Inc. 2013

Authors and Affiliations

  1. 1.Faculty of Computational Mathematics and CyberneticsMoscow State UniversityMoscowRussia

Personalised recommendations