On the complexity of integer matrix multiplication
From MaRDI portal
Publication:1635268
DOI10.1016/j.jsc.2017.11.001zbMath1395.68152OpenAlexW2768477013MaRDI QIDQ1635268
Joris van der Hoeven, David I. Harvey
Publication date: 6 June 2018
Published in: Journal of Symbolic Computation (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1016/j.jsc.2017.11.001
Analysis of algorithms and problem complexity (68Q25) Symbolic computation and algebraic computation (68W30)
Related Items
Integer multiplication in time \(O(n\log n)\), The complexity of computing (almost) orthogonal matrices with \(\varepsilon\)-copies of the Fourier transform, An exponent one-fifth algorithm for deterministic integer factorisation, Lower Bounds for Multiplication via Network Coding, Counting points on smooth plane quartics
Uses Software
Cites Work
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Even faster integer multiplication
- Matrix multiplication via arithmetic progressions
- Newton's method and FFT trading
- On fast multiplication of polynomials over arbitrary algebras
- Fast evaluation of holonomic functions
- On finding primitive roots in finite fields
- PRIMES is in P
- Polynomial evaluation and interpolation on special sets of points
- Counting points on hyperelliptic curves in average polynomial time
- Efficient accelero-summation of holonomic functions
- Gaussian elimination is not optimal
- Fast multiplication of large numbers
- The Difference Between Consecutive Primes, II
- Computing Hasse–Witt matrices of hyperelliptic curves in average polynomial time
- Computing -series of geometrically hyperelliptic curves of genus three
- Modular SIMD arithmetic in M <scp>athemagix</scp>
- Faster Polynomial Multiplication over Finite Fields
- Computing Hasse–Witt matrices of hyperelliptic curves in average polynomial time, II
- Powers of tensors and fast matrix multiplication
- Computing zeta functions of arithmetic schemes
- Faster Integer Multiplication
- The truncated fourier transform and applications
- Linear Recurrences with Polynomial Coefficients and Application to Integer Factorization and Cartier–Manin Operator
- Fast evaluation of holonomic functions near and in regular singularities
