Fast rectangular matrix multiplication and some applications
From MaRDI portal
Publication:931517
DOI10.1007/s11425-007-0169-2zbMath1151.68428OpenAlexW2137152740MaRDI QIDQ931517
ShanXue Ke, BenSheng Zeng, Pan, Victor Y., Wenbao Han
Publication date: 25 June 2008
Published in: Science in China. Series A (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1007/s11425-007-0169-2
rectangular matrix multiplicationasymptotic arithmetic complexitybilinear algorithmpolynomial factorization over finite fields
Analysis of algorithms and problem complexity (68Q25) Number-theoretic algorithms; complexity (11Y16)
Related Items
Fast operations on linearized polynomials and their applications in coding theory, Fast matrix multiplication and its algebraic neighbourhood, Approximation Schemes for Machine Scheduling with Resource (In-)dependent Processing Times, Optimal fast Johnson-Lindenstrauss embeddings for large data sets
Cites Work
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- The aggregation and cancellation techniques as a practical tool for faster matrix multiplication
- Matrix multiplication via arithmetic progressions
- Parallel evaluation of the determinant and of the inverse of a matrix
- Univariate polynomial factorization over finite fields
- \(0(n^{2.7799})\) complexity for \(n\times n\) approximate matrix multiplication
- Fast rectangular matrix multiplication and applications
- Using fast matrix multiplication to find basic solutions
- Factorization of polynomials and some linear-algebra problems over finite fields
- Rectangular matrix multiplication revisited
- Computing Frobenius maps and factoring polynomials
- How Can We Speed Up Matrix Multiplication?
- Partial and Total Matrix Multiplication
- On the Asymptotic Complexity of Matrix Multiplication
- Rapid Multiplication of Rectangular Matrices
- On a New Factorization Algorithm for Polynomials Over Finite Fields
- Subquadratic-time factoring of polynomials over finite fields
- On Sets of Integers Which Contain No Three Terms in Arithmetical Progression
- Factoring polynomials over finite fields: A survey
