Group-theoretic algorithms for matrix multiplication

Proceedings - Annual IEEE Symposium on Foundations of Computer Science, FOCS

Volumn 2005, Issue , 2005, Pages 379-388

  Cohn, Henry ^a   Kleinberg, Robert ^b,c   Szegedy, Balázs ^a   Umans, Christopher ^d  

^a MICROSOFT RESEARCH   (United States)

^b MASSACHUSETTS INSTITUTE OF TECHNOLOGY   (United States)

^c Department of Computer Science and School of Operations Research and Information Engineering   (United States)

^d CALIFORNIA INSTITUTE OF TECHNOLOGY   (United States)

Author keywords

[No Author keywords available]

Indexed keywords

GROUP THEORETIC ALGORITHMS; MATRIX MULTIPLICATION; STANDARD ALGORITHMS;

ALGORITHMS; COMBINATORIAL MATHEMATICS; COMPUTATIONAL METHODS; MATRIX ALGEBRA; NUMERICAL ANALYSIS; PROBLEM SOLVING;

LINEAR ALGEBRA;

EID: 33748037756     PISSN: 02725428     EISSN: None     Source Type: Conference Proceeding    
DOI: 10.1109/SFCS.2005.39     Document Type: Conference Paper

References (9)

1. P. Bürgisser, M. Clausen, and M. A. Shokrollahi. Algebraic Complexity Theory, volume 315 of Grundlehren der mathematischen Wissenschaften. Springer-Verlag, 1997.
2. H. Cohn and C. Umans. A Group-theoretic Approach to Fast Matrix Multiplication. Proceedings of the 44th Annual Symposium on Foundations of Computer Science, 11-14 October 2003, Cambridge, MA, IEEE Computer Society, pp. 438-449, arXiv:math.GR/0307321.
3. D. Coppersmith and S. Winograd. Matrix multiplication via arithmetic progressions. J. Symbolic Computation, 9:251-280, 1990.
4. B. Huppert. Character Theory of Finite Groups. Number 25 in de Gruyter Expositions in Mathematics. Walter de Gruyter, Berlin, 1998.
5. G. James and M. Liebeck. Representations and Characters of Groups. Cambridge University Press, Cambridge, second edition, 2001.
6. R. Salem and D. C. Spencer. On sets of integers which contain no three terms in arithmetical progression. Proc. Nat. Acad. Sci. USA, 28:561-563, 1942.
7. G. Simonyi. Perfect graphs and graph entropy. An updated survey. Perfect graphs, 293-328, Wiley-Intersci. Ser. Discrete Math. Optim., Wiley, Chichester, 2001.
8. V. Strassen. Gaussian elimination is not optimal. Numerische Mathematik, 13:354-356, 1969.
9. V. Strassen. Relative bilinear complexity and matrix multiplication. J. Reine Angew. Math., 375/376:406-443, 1987.