Geodesic
Некоторые комбинаторные аспекты теоретико-группового подхода к проблеме быстрого умножения матриц
Čebyševskij sbornik, Tome 13 (2012) no. 1, pp. 102-109 
Yu. V. Kuznetsov. Некоторые комбинаторные аспекты теоретико-группового подхода к проблеме быстрого умножения матриц. Čebyševskij sbornik, Tome 13 (2012) no. 1, pp. 102-109. http://geodesic.mathdoc.fr/item/CHEB_2012_13_1_a10/
@article{CHEB_2012_13_1_a10,
     author = {Yu. V. Kuznetsov},
     title = {{\CYRN}{\cyre}{\cyrk}{\cyro}{\cyrt}{\cyro}{\cyrr}{\cyrery}{\cyre} {\cyrk}{\cyro}{\cyrm}{\cyrb}{\cyri}{\cyrn}{\cyra}{\cyrt}{\cyro}{\cyrr}{\cyrn}{\cyrery}{\cyre} {\cyra}{\cyrs}{\cyrp}{\cyre}{\cyrk}{\cyrt}{\cyrery} {\cyrt}{\cyre}{\cyro}{\cyrr}{\cyre}{\cyrt}{\cyri}{\cyrk}{\cyro}-{\cyrg}{\cyrr}{\cyru}{\cyrp}{\cyrp}{\cyro}{\cyrv}{\cyro}{\cyrg}{\cyro} {\cyrp}{\cyro}{\cyrd}{\cyrh}{\cyro}{\cyrd}{\cyra} {\cyrk} {\cyrp}{\cyrr}{\cyro}{\cyrb}{\cyrl}{\cyre}{\cyrm}{\cyre} {\cyrb}{\cyrery}{\cyrs}{\cyrt}{\cyrr}{\cyro}{\cyrg}{\cyro} {\cyru}{\cyrm}{\cyrn}{\cyro}{\cyrzh}{\cyre}{\cyrn}{\cyri}{\cyrya} {\cyrm}{\cyra}{\cyrt}{\cyrr}{\cyri}{\cyrc}},
     journal = {\v{C}eby\v{s}evskij sbornik},
     pages = {102--109},
     year = {2012},
     volume = {13},
     number = {1},
     language = {ru},
     url = {http://geodesic.mathdoc.fr/item/CHEB_2012_13_1_a10/}
}
TY  - JOUR
AU  - Yu. V. Kuznetsov
TI  - Некоторые комбинаторные аспекты теоретико-группового подхода к проблеме быстрого умножения матриц
JO  - Čebyševskij sbornik
PY  - 2012
SP  - 102
EP  - 109
VL  - 13
IS  - 1
UR  - http://geodesic.mathdoc.fr/item/CHEB_2012_13_1_a10/
LA  - ru
ID  - CHEB_2012_13_1_a10
ER  - 
%0 Journal Article
%A Yu. V. Kuznetsov
%T Некоторые комбинаторные аспекты теоретико-группового подхода к проблеме быстрого умножения матриц
%J Čebyševskij sbornik
%D 2012
%P 102-109
%V 13
%N 1
%U http://geodesic.mathdoc.fr/item/CHEB_2012_13_1_a10/
%G ru
%F CHEB_2012_13_1_a10

Voir la notice de l'article provenant de la source Math-Net.Ru

[1] V. Strassen, “Gaussian elimination is not optimal”, Numer. Math., 13:4 (1969), 354–356 | DOI | MR | Zbl

[2] D. Coppersmith, S. Winograd, “Matrix multiplication via arithmetic progressions”, J. Symbolic Comput., 9:3 (1990), 251-280 | DOI | MR | Zbl

[3] V. Vassilevska Williams, “Multiplying Matrices Faster than Coppersmith-Winograd”, Proceedings of the 44-th Symposium on Theory of Computing, STOC'12, 2012; полная версия: http://www.cs.berkeley.edu/~virgi/matrixmult.pdf

[4] H. Cohn, C. Umans, “A group theoretic approach to fast matrix multiiplication”, Proceedings of the 44th Annual Symposium on Foundations of Computer Science, 2003, 438–449 | DOI

[5] H. Cohn, R. Kleinberg, B. Szegedy, C. Umans, “Group-theoretic algorithms for matrix multiiplication”, Proceedings of the 46th Annual Symposium on Foundations of Computer Science, 2005, 379–388

[6] V. P. Platonov, Yu. V. Kuznetsov, M. M. Petrunin, “O teoretiko-gruppovom podkhode k probleme bystrogo umnozheniya matrits”, Matematicheskoe i kompyuternoe modelirovanie sistem: teoreticheskie i prikladnye aspekty, Sbornik nauchnykh trudov NIISI RAN, Moskva, 2009, 4–15

[7] N. Alon, A. Shpilka, C. Umans, On sunflowers and matrix multiplication, Electronic Colloquium on Computational Complexity, Report No 67, 2011 | Zbl