In-place fast polynomial modular remainder

DOI10.1145/3666000.3669672MaRDI QIDQ7033566zbMATH OpenFDO

Authors Jean-Guillaume Dumas, Bruno Grenet

Publication date 3 February 2025

Full work available at URL https://doi.org/10.1145/3666000.3669672

Mathematics Subject Classification ID

Computational methods for problems pertaining to field theory (12-08) Analysis of algorithms (68W40)

Cites work

• An in-place truncated Fourier transform
• An in-place truncated Fourier transform and applications to polynomial multiplication
• Computing with a full memory: catalytic space
• Fast in-place algorithms for polynomial operations
• Fast inversion of triangular Toeplitz matrices
• Fast parallel polynomial division via reduction to triangular Toeplitz matrix inversion and to polynomial inversion modulo a power
• Generic reductions for in-place polynomial multiplication
• scientific article; zbMATH DE number 1682655 (Why is no real title available?)
• scientific article; zbMATH DE number 691245 (Why is no real title available?)
• scientific article; zbMATH DE number 2151179 (Why is no real title available?)
• scientific article; zbMATH DE number 961607 (Why is no real title available?)
• In-place accumulation of fast multiplication formulae
• Memory efficient scheduling of Strassen-Winograd's matrix multiplication algorithm
• Modern computer algebra
• On computing reciprocals of power series
• On fast multiplication of polynomials over arbitrary algebras
• Polynomial multiplication over finite fields in time O(n n)
• Space- and time-efficient polynomial multiplication

Cited in

(2)

• Fast in-place accumulation
• In-place accumulation of fast multiplication formulae

This page was built for publication: In-place fast polynomial modular remainder

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q7033566)