On Multiplication of Polynomials Modulo a Polynomial

DOI10.1137/0209021zbMath0446.68032OpenAlexW2090210354MaRDI QIDQ3891764

Shmuel Winograd

Publication date: 1980

Published in: SIAM Journal on Computing (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1137/0209021

zbMATH Keywords

multiplicative complexityproduct of polynomials

Mathematics Subject Classification ID

Analysis of algorithms and problem complexity (68Q25) Polynomials in general fields (irreducibility, etc.) (12E05)

Related Items (2)

Theory construction in psychology: The interpretation and integration of psychological data ⋮ On the multiplicative complexity of the discrete Fourier transform

This page was built for publication: On Multiplication of Polynomials Modulo a Polynomial