Skew-polynomial-sparse matrix multiplication
From MaRDI portal
Publication:6051113
DOI10.1016/j.jsc.2023.102240arXiv2205.06429MaRDI QIDQ6051113
No author found.
Publication date: 19 September 2023
Published in: Journal of Symbolic Computation (Search for Journal in Brave)
Full work available at URL: https://arxiv.org/abs/2205.06429
Cites Work
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Matrix multiplication via arithmetic progressions
- Fast algorithms for the characteristic polynomial
- Computational methods of linear algebra
- Fast algorithm for sparse matrix multiplication
- On fast multiplication of polynomials over arbitrary algebras
- \(0(n^{2.7799})\) complexity for \(n\times n\) approximate matrix multiplication
- The ubiquitous Kronecker product
- Hartmann-Tzeng bound and skew cyclic codes of designed Hamming distance
- Fast structured matrix computations: tensor rank and Cohn-Umans method
- Fast bilinear algorithms for symmetric tensor contractions
- Some properties of skew codes over finite fields
- Quasi-Toeplitz matrix arithmetic: a MATLAB toolbox
- Linear codes using skew polynomials with automorphisms and derivations
- Gaussian elimination is not optimal
- Efficient determination of the transitive closure of a directed graph
- Fast Matrix Multiplication
- Fast sparse matrix multiplication
- Matrix-vector product for confluent Cauchy-like matrices with application to confluent rational interpolation
- Powers of tensors and fast matrix multiplication
- Solving sparse linear equations over finite fields
- A Fast Adaptive Multipole Algorithm for Particle Simulations
- Partial and Total Matrix Multiplication
- Algebraic Complexity Theory
- Two Fast Algorithms for Sparse Matrices: Multiplication and Permuted Transposition
- Triangular Factorization and Inversion by Fast Matrix Multiplication
- Polynomials and the exponent of matrix multiplication
- Fast Multiplication for Skew Polynomials
- Ubiquity of the exponent of matrix multiplication
- Sparse multiplication for skew polynomials
- A Class of Methods for Solving Nonlinear Simultaneous Equations
- Multiplying matrices faster than coppersmith-winograd
- Probability and Computing
- On Minimizing the Number of Multiplications Necessary for Matrix Multiplication
- A fast algorithm for particle simulations
This page was built for publication: Skew-polynomial-sparse matrix multiplication
