
460 Design and Analysis of Algorithms
space and time requirements of an algorithm
is not a simple one? At each iteration step,
what does each variable f, f 1, and f 2 repre-
sent, in terms of computations required to be
done in the recursive implementation to get
the same values?
Web Resources
Time-Space Trade-off Introduction:
URL: http://www.cs.brown.edu/courses/
cs159/lect.13. SpaceTimeI.pdf
Introductory Time-Space Extreme Trade-off
Time-Space Trade-off advanced:
URL: http://www.cs.brown.edu/courses/
cs159/lect.14. SpaceTimeII.pdf
Flow Properties of Functions, Flow Properties
of Matrix Multiplications
Time-Space Trade-off advanced:
URL: http ...