Time-space tradeoffs for computing functions, using connectivity properties of their circuits
Martin Tompa · ACM Symposium on Theory of Computing (STOC) · 1978
Recent research has investigated time-space tradeoffs for register allocation strategies of certain fixed sets of expressions. This paper is concerned with the time-space tradeoff for register allocation strategies of any set of expressions which compute given functions. Time-space tradeoffs for pebbling superconcentrators and grates are developed. Corollaries which follow include tradeoffs for any straight-line program which computes polynomial multiplication, polynomial convolution, the discrete Fourier transform, oblivious merging, and most sets of linear forms.
Cited by 53 works. doi:10.1145/800133.804348
Authors
References
- THE COMPUTATIONAL COMPLEXITY OF ALGEBRAIC AND NUMERIC PROBLEMS.
- Comparative schematology
- Graph-theoretic properties in computational complexity
- On Time Versus Space
- Graph-theoretic arguments in low-level complexity
- Shifting Graphs and Their Applications
- Space-time trade-offs on the FFT algorithm
- Space bounds for a game on graphs
- A Time-Space Trade-Off
- Time-space trade-offs in a pebble game