论文信息 - Optimal Algorithms for Finite Dimensional Simply Generated Algebras - 字舞流文

Optimal Algorithms for Finite Dimensional Simply Generated Algebras

Annemarie Fellmann

[1] Hans F. de Groote. On Varieties of Optimal Algorithms for the Computation of Bilinear Mappings I. The Isotropy Group of a Bilinear Mapping , 1978, Theor. Comput. Sci..

[2] Jacques Morgenstern,et al. On associative algebras of minimal rank , 1984, International Symposium on Applied Algebra, Algebraic Algorithms and Error-Correcting Codes.

[3] Hans F. de Groote. Characterization of Division Algebras of Minimal Rank and the Structure of Their Algorithm Varieties , 1983, SIAM J. Comput..

[4] Michael Francis Atiyah,et al. Introduction to commutative algebra , 1969 .

[5] Joos Heintz,et al. A Lower Bound for the Bilinear Complexity of Some Semisimple Lie Algebras , 1985, AAECC.

[6] Yechezkel Zalcstein,et al. Algebras Having Linear Multiplicative Complexities , 1977, JACM.

[7] Shmuel Winograd. On Multiplication in Algebraic Extension Fields , 1979, Theor. Comput. Sci..

[8] Joos Heintz,et al. Commutative algebras of minimal rank , 1983 .

[9] Volker Strassen,et al. On the Algorithmic Complexity of Associative Algebras , 1981, Theor. Comput. Sci..

[10] Michael Clausen,et al. On a class of primary algebras of minimal rank , 1985 .