Voir la notice de l'article provenant de la source Math-Net.Ru
@article{DM_2012_24_4_a0, author = {V. Lysikov}, title = {On the algebras of almost minimal rank}, journal = {Diskretnaya Matematika}, pages = {3--18}, publisher = {mathdoc}, volume = {24}, number = {4}, year = {2012}, language = {ru}, url = {http://geodesic.mathdoc.fr/item/DM_2012_24_4_a0/} }
V. Lysikov. On the algebras of almost minimal rank. Diskretnaya Matematika, Tome 24 (2012) no. 4, pp. 3-18. http://geodesic.mathdoc.fr/item/DM_2012_24_4_a0/
[1] Alder A., Strassen V., “On the algorithmic complexity of associative algebras”, Theor. Comput. Sci., 15 (1981), 201–211 | DOI | MR | Zbl
[2] Bläser M., “A complete characterization of the algebras of minimal bilinear complexity”, SIAM J. Comput., 34 (2004), 277–298 | DOI | MR
[3] Bläser M., de Voltaire A. M., “Semisimple algebras of almost minimal rank over the reals”, Theor. Comput. Sci., 410 (2009), 5202–5214 | DOI | MR
[4] Van der Varden B. L., Algebra, Nauka, Moskva, 1976 | MR
[5] Drozd Yu. A., Kirichenko V. V., Konechnomernye algebry, Vischa shkola, Kiev, 1980 | MR | Zbl
[6] Knus M. A., Merkurjev A., Rost M., et al., The book of involutions, AMS, Providence, 1998 | Zbl
[7] Bürgisser P., Clausen M., Shokrollahi M. A., Algebraic complexity theory, Springer, Berlin, 1997 | MR
[8] Strassen V., “Rank and optimal computation of generic tensors”, Linear Algebra Appl., 52–53 (1983), 645–685 | MR | Zbl
[9] Bläser M., “Beyond the Alder–Strassen bound”, Theor. Comput. Sci., 331 (2005), 3–21 | DOI | MR
[10] Bläser M., “On the complexity of the multiplication of matrices of small formats”, J. Complexity, 19 (2003), 43–60 | DOI | MR
[11] Ballet S., “An improvement of the construction of the D. V. and G. V. Chudnovsky algorithm for multiplication in finite fields”, Theor. Comput. Sci., 352 (2006), 293–305 | DOI | MR | Zbl