Fast matrix multiplication using coherent configurations

Proceedings of the Annual ACM-SIAM Symposium on Discrete Algorithms

Volumn , Issue , 2013, Pages 1074-1087

  Cohn, Henry ^a   Umans, Christopher ^b  

^a MICROSOFT RESEARCH   (United States)

^b California Institute of Technology   (United States)

Author keywords

[No Author keywords available]

Indexed keywords

COMBINATORIAL MATHEMATICS; EMBEDDINGS; GEOMETRY; GROUP THEORY; TENSORS;

ADJACENCY ALGEBRA; CLOSURE PROPERTY; COHERENT CONFIGURATIONS; COMBINATORIAL OBJECTS; EMBEDDING MATRICES; FAST MATRIX MULTIPLICATION; IMPORTANT FEATURES; MATRIX MULTIPLICATION;

MATRIX ALGEBRA;

EID: 84876057791     PISSN: None     EISSN: None     Source Type: Conference Proceeding    
DOI: 10.1137/1.9781611973105.77     Document Type: Conference Paper

References (20)

1. N. Alon, A. Shpilka, and C. Umans. On sunflowers and matrix multiplication. Proceedings of the 27th IEEE Conference on Computational Complexity, 26-29 June 2012, Porto, Portugal, IEEE Computer Society, pp. 214-223.
2. D. Bini. Relations between exact and approximate bilinear algorithms. Applications. Calcolo, 17:87-97, 1980.
3. 2.7799) complexity for matrix multiplication. Inf. Proc. Letters, 8:234-235, 1979.
4. M. Bläser. Complexity of bilinear algorithms (course notes taken by F. Bendun). http://www-cc.cs.uni-saarland.de/media/oldmaterial/bc.pdf, 2009.
5. P. Bürgisser, M. Clausen, and M. A. Shokrollahi. Algebraic Complexity Theory, volume 315 of Grundlehren der Mathematischen Wissenschaften. Springer-Verlag, 1997.
6. P. J. Cameron. Permutation Groups, volume 45 of London Mathematical Socieity Students Texts. Cambridge University Press, 1999.
7. H. Cohn, R. Kleinberg, B. Szegedy, and C. Umans. Group-theoretic algorithms for matrix multiplication. Proceedings of the 46th Annual Symposium on Foundations of Computer Science, 23-25 October 2005, Pittsburgh, PA, IEEE Computer Society, pp. 379-388, arXiv:math.GR/0511460.
8. 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.
9. D. Coppersmith and S. Winograd. Matrix multiplication via arithmetic progressions. J. Symbolic Computation, 9:251-280, 1990.
10. A. M. Davie and A. J. Stothers. Improved bound for complexity of matrix multiplication. Proeedings of the Royal Society of Edinburgh, Section A. To appear.
11. J. Håstad. Tensor rank is NP-Complete. J. Algorithms, 11: 644-654, 1990.
12. D. G. Higman. Coherent configurations I. Rend. Sem. Mat. Univ. Padova, 44:1-25, 1970.
13. D. G. Higman. Combinatorial considerations about permutation groups. Lectures given in 1971. Mathematical Institute, Oxford University, Oxford, 1972.
14. D. G. Higman. Coherent configurations I. Ordinary representation theory. Geometriae Dedicata, 4:1-32, 1975.
15. 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.
16. A. Schönhage. Partial and total matrix multiplication. SIAM J. Comp., 10:434-455, 1981.
17. A. Stothers. On the complexity of matrix multiplication. Ph.D. dissertation, University of Edinburgh, 2010.
18. V. Strassen. Gaussian elimination is not optimal. Numerische Mathematik, 13:354-356, 1969.
19. V. Strassen. Relative bilinear complexity and matrix multiplication. J. Reine Angew. Math., 375/376:406-443, 1987.
20. V. Vassilevska Williams. Multiplying matrices faster than Coppersmith-Winograd. Proceedings of the 44th ACM Symposium on Theory of Computing, 19-22 May 2012, New York, NY, Association for Computing Machinery, pp. 887-898.