Space- and time-efficient polynomial multiplication
From MaRDI portal
Recommendations
Cited in
(14)- Time-space efficient algorithms for computing convolutions and related problems
- On fast multiplication of polynomials over arbitrary algebras
- Dense polynomial multiplication with reduced array manipulation overhead
- Code Generation for Polynomial Multiplication
- Impact of Intel's new instruction sets on software implementation of \(GF(2)[x]\) multiplication
- Low-Weight Polynomial Form Integers for Efficient Modular Multiplication
- Fast Multiplication for Skew Polynomials
- Generic reductions for in-place polynomial multiplication
- Nearly Optimal Sparse Polynomial Multiplication
- Complexity and performance results for non FFT-based univariate polynomial multiplication
- Quantum circuits for high-degree and half-multiplication for post-quantum analysis
- In-place fast polynomial modular remainder
- In-place accumulation of fast multiplication formulae
- Faster polynomial multiplication via multipoint Kronecker substitution
This page was built for publication: Space- and time-efficient polynomial multiplication
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q2883831)