Upper and Lower Bounds on Time-Space Tradeoffs for Computations with Embedded Fast Fourier Transforms (Q4729344)
From MaRDI portal
 | This is the item page for this Wikibase entity, intended for internal use and editing purposes. Please use this page instead for the normal view: Upper and Lower Bounds on Time-Space Tradeoffs for Computations with Embedded Fast Fourier Transforms |
scientific article; zbMATH DE number 4113997
| Language | Label | Description | Also known as |
|---|---|---|---|
| default for all languages | No label defined |
||
| English | Upper and Lower Bounds on Time-Space Tradeoffs for Computations with Embedded Fast Fourier Transforms |
scientific article; zbMATH DE number 4113997 |
Statements
Upper and Lower Bounds on Time-Space Tradeoffs for Computations with Embedded Fast Fourier Transforms (English)
0 references
1988
0 references
time-space trade offs
0 references
computational complexity
0 references
embedded Fast Fourier transforms
0 references
polynomial multiplication
0 references
pebble game
0 references
0.8843619
0 references
0.87134373
0 references
0 references
0.85504323
0 references
0.8534589
0 references
0.85333306
0 references
0.84846354
0 references
0.84586453
0 references
0.8441947
0 references
