Time-Space Tradeoffs in Algebraic Comple
β
M. Aldaz; J. Heintz; G. Matera; J.L. MontaΓ±a; L.M. Pardo
π
Article
π
2000
π
Elsevier Science
π
English
β 294 KB
We exhibit a new method for showing lower bounds for time-space tradeoffs of polynomial evaluation procedures given by straight-line programs. From the tradeoff results obtained by this method we deduce lower space bounds for polynomial evaluation procedures running in optimal nonscalar time. Time,