Time-space tradeoffs for computing functions, using connectivity properties of their circuits

Authors:
Martin Tompa
Affiliations:
-
Venue:
STOC '78 Proceedings of the tenth annual ACM symposium on Theory of computing
Year:
1978

Citing 4
Cited 14

Shifting Graphs and Their Applications

Journal of the ACM (JACM)
On Time Versus Space

Journal of the ACM (JACM)
Time-Space Trade-Offs in a Pebble Game

Proceedings of the Fourth Colloquium on Automata, Languages and Programming
Space bounds for a game on graphs

STOC '76 Proceedings of the eighth annual ACM symposium on Theory of computing

Time-Space trade-offs for some algebraic problems

Journal of the ACM (JACM)
A Time-Space Trade-Off

Journal of the ACM (JACM)
Improved Bounds on the Problem of Time-Space Trade-Off in the Pebble Game

Journal of the ACM (JACM)
Asymptotically tight bounds on time-space trade-offs in a pebble game

Journal of the ACM (JACM)
Space-time tradeoffs for linear recursion

POPL '79 Proceedings of the 6th ACM SIGACT-SIGPLAN symposium on Principles of programming languages
Upper and lower bounds on time-space tradeoffs

STOC '79 Proceedings of the eleventh annual ACM symposium on Theory of computing
Space-time tradeoffs and first order problems in a model of programs

STOC '80 Proceedings of the twelfth annual ACM symposium on Theory of computing
Graph pebbling with many free pebbles can be difficult

STOC '80 Proceedings of the twelfth annual ACM symposium on Theory of computing
Two familiar transitive closure algorithms which admit no polynomial time, sublinear space implementations

STOC '80 Proceedings of the twelfth annual ACM symposium on Theory of computing
Time-space tradeoffs for some algebraic problems

STOC '80 Proceedings of the twelfth annual ACM symposium on Theory of computing
Multi-party protocols

STOC '83 Proceedings of the fifteenth annual ACM symposium on Theory of computing
Algebraic complexity theory

IBM Journal of Research and Development
A note on time-space tradeoffs for computing continuous functions

Information Processing Letters
On the Relative Strength of Pebbling and Resolution

ACM Transactions on Computational Logic (TOCL)

Quantified Score

Hi-index	0.00

Visualization

Abstract

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.