Fast Rectangular Matrix Multiplication and Applications
Authors:
- Xiaohan HuangXHXiaohan Huang
- Victor Y. PanVPVictor Y. Pan
- 1 June 1998
- journal article
- Published by Elsevier in Journal of Complexity
- Vol. 14 (2) , 257-299
Abstract
No abstract availableKeywords
This publication has 19 references indexed in Scilit:
- Using fast matrix multiplication to find basic solutionsTheoretical Computer Science, 1998
- Rectangular Matrix Multiplication RevisitedJournal of Complexity, 1997
- Matrix multiplication via arithmetic progressionsJournal of Symbolic Computation, 1990
- On the Asymptotic Complexity of Matrix MultiplicationSIAM Journal on Computing, 1982
- Rapid Multiplication of Rectangular MatricesSIAM Journal on Computing, 1982
- O(n2.7799) complexity for n × n approximate matrix multiplicationInformation Processing Letters, 1979
- Fast Algorithms for Manipulating Formal Power SeriesJournal of the ACM, 1978
- On the Number of Multiplications Required for Matrix MultiplicationSIAM Journal on Computing, 1976
- Factoring polynomials over large finite fieldsMathematics of Computation, 1970
- On Sets of Integers Which Contain No Three Terms in Arithmetical ProgressionProceedings of the National Academy of Sciences, 1946