On fast multiplication of polynomials, the Fourier and Hartley transforms

DOI10.1515/dma.2000.10.5.499zbMath1001.11060OpenAlexW2159611663MaRDI QIDQ2708303

Sergey B. Gashkov

Publication date: 17 December 2002

Published in: Discrete Mathematics and Applications (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1515/dma.2000.10.5.499

zbMATH Keywords

complexityfinite fieldsfast algorithmFourier transformationdiscrete Hartley transformationmultiplication of polynomials with real-valued coefficients

Mathematics Subject Classification ID

Number-theoretic algorithms; complexity (11Y16) Numerical methods for discrete and fast Fourier transforms (65T50) Fourier and Fourier-Stieltjes transforms and other transforms of Fourier type (42A38)

Related Items (2)

Complexity of computation in finite fields ⋮ Unnamed Item

This page was built for publication: On fast multiplication of polynomials, the Fourier and Hartley transforms