A Time-Space Trade-Off

A problem with a demonstrable Ume-space trade-off Is exhibited The problem is to compile a straight-line program for a certain unmterprted expression; time ~s reckoned as the number of mstrucUons m the program, space as the number of registers referred to There are programs using linear space and linear tune, but any program using less than linear space uses more than linear rune

[1]  Robert E. Tarjan,et al.  Space Bounds for a Game of Graphs , 1976, STOC.

[2]  Martin Tompa,et al.  Time-space tradeoffs for computing functions, using connectivity properties of their circuits , 1978, J. Comput. Syst. Sci..

[3]  Leslie G. Valiant,et al.  On time versus space and related problems , 1975, 16th Annual Symposium on Foundations of Computer Science (sfcs 1975).

[4]  Carl Hewitt,et al.  Comparative Schematology , 1970 .

[5]  Robert E. Tarjan,et al.  Time-Space Trade-Offs in a Pebble Game , 1977, ICALP.

[6]  Robert E. Tarjan,et al.  Space bounds for a game on graphs , 1976, STOC '76.

[7]  John E. Savage,et al.  Space-time trade-offs on the FFT algorithm , 1978, IEEE Trans. Inf. Theory.