Upper and Lower Bounds on Time-Space Tradeoffs for Computations with Embedded Fast Fourier Transforms

DOI10.1137/0401003zbMath0679.68073OpenAlexW1982322154MaRDI QIDQ4729344

David A. Carlson

Publication date: 1988

Published in: SIAM Journal on Discrete Mathematics (Search for Journal in Brave)

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

zbMATH Keywords

computational complexitypolynomial multiplicationpebble gameembedded Fast Fourier transformstime-space trade offs

Mathematics Subject Classification ID

Analysis of algorithms and problem complexity (68Q25) Numerical methods for trigonometric approximation and interpolation (65T40)

This page was built for publication: Upper and Lower Bounds on Time-Space Tradeoffs for Computations with Embedded Fast Fourier Transforms

"Explain this."

"What is this research area about?"