Skip to main content
SpringerLink
Log in

On associative algebras of minimal rank

  • Conference paper
  • First Online:
Applied Algebra, Algorithmics and Error-Correcting Codes (AAECC 1984)

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

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. Alder, A. & Strassen, V.: On the algorithmic complexity of associative algebras. Theoret. Comput. Sci. 15 (1981) 201–211.

    Google Scholar 

  2. Atiyah, M.F. & Macdonald, I.G.: Introduction to commutative algebra. Addison — Wesley, Reading MA (1969).

    Google Scholar 

  3. Baur, W.: personal communication (1982).

    Google Scholar 

  4. Behrens, E.-A.: Ring Theory. Pure & Appl. Math. 44; Academic Press, New York (1972).

    Google Scholar 

  5. Bini, D. et al.: O(n2.7799) complexity for matrix multiplication. Inform. Proc. Letters 8 (1979) 234–235.

    Article  Google Scholar 

  6. Büchi, W. & Clausen, M.: On a Class of Primary Algebras of Minimal Rank. Linear Algebra and its Appl. 69 (1985) 249–268.

    Article  Google Scholar 

  7. Coppersmith, D. & Winograd, S.: On the asymptotic complexity of matrix multiplication. SIAM J. Comput. 11 (1982) 472–492.

    Article  Google Scholar 

  8. Feig, E.: On systems of bilinear forms whose minimal divisor-free algorithms are all bilinear. J. of Algorithms 2 (1981) 261–281.

    Article  Google Scholar 

  9. Giraldo, L.: Thesis, University of Buenos Aires.

    Google Scholar 

  10. de Groote, H.F.: On varieties of optimal algorithms for the computation of bilinear mappings. I. The isotropy group of a bilinear mapping. Theoret. Comput. Sci. 7 (1978) 1–24.

    Article  Google Scholar 

  11. de Groote, H.F.: Characterization of division algebras of minimal rank and the structure of their algorithm varieties. SIAM J. Comput. 12 (1983) 101–117.

    Google Scholar 

  12. de Groote, H.F.: Lectures on the complexity of bilinear problems. (to be published) (1982).

    Google Scholar 

  13. de Groote, H.F. & Heintz, J.: Commutative algebras of minimal rank. Linear Algebra and its Appl. 55 (1983) 37–68.

    Article  Google Scholar 

  14. Lafon, J.C. & Winograd, S.: A lower bound for the multiplicative complexity of the product of two matrices. (unpublished) (1978).

    Google Scholar 

  15. Schönhage, A.: Partial and total matrix multiplication. SIAM J. Comput. 10 (1981) 434–455.

    Article  Google Scholar 

  16. Strassen, V.: Gaussian elimination is not optimal. Numer. Math. 13 (1969) 354–356.

    Google Scholar 

  17. Strassen, V.: Vermeidung von Divisionen. J. Reine und Angew. Math. 264 (1973) 184–202.

    Google Scholar 

  18. Winograd, S.: On computing the discrete Fourier transform. Proc. Nat. Acad. Sci. USA 73 (1976) 1005–1006.

    Google Scholar 

  19. Winograd, S.: Some bilinear forms whose multiplicative complexity depends on the field of constants. Math. System Theory 10 (1977) 169–180.

    Google Scholar 

Download references

Author information

Authors and Affiliations

  1. Consejo Nacional de Investigaciones Cientificas y Técnicas (CONICET), Universidad Nacional de La Plata, La Plata, Provincia Buenos Aires, Argentina

    Joos Heintz

  2. Institut des Mathématiques et Sciences Physiques Parc Valrose, Université de Nice, F - 06034, Nice Cedex, France

    Jacques Morgenstern

  3. INRIA, Sophia Antipolis, F - 06560, Valbonne, France

    Jacques Morgenstern

Authors
  1. Joos Heintz
    View author publications

    You can also search for this author in PubMed Google Scholar

  2. Jacques Morgenstern
    View author publications

    You can also search for this author in PubMed Google Scholar

Editor information

Alain Poli

Rights and permissions

Reprints and permissions

Copyright information

© 1986 Springer-Verlag Berlin Heidelberg

About this paper

Cite this paper

Heintz, J., Morgenstern, J. (1986). On associative algebras of minimal rank. In: Poli, A. (eds) Applied Algebra, Algorithmics and Error-Correcting Codes. AAECC 1984. Lecture Notes in Computer Science, vol 228. Springer, Berlin, Heidelberg. https://doi.org/10.1007/3-540-16767-6_47

Download citation

  • DOI: https://doi.org/10.1007/3-540-16767-6_47

  • Published:

  • Publisher Name: Springer, Berlin, Heidelberg

  • Print ISBN: 978-3-540-16767-9

  • Online ISBN: 978-3-540-38813-5

  • eBook Packages: Springer Book Archive

Publish with us

Policies and ethics

Search

Navigation