Abstract
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 is 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. © 1978, ACM. All rights reserved.
Author supplied keywords
Cite
CITATION STYLE
APA
Pippenger, N. (1978). A Time-Space Trade-Off. Journal of the ACM (JACM), 25(3), 509–515. https://doi.org/10.1145/322077.322091
Register to see more suggestions
Mendeley helps you to discover research relevant for your work.
Already have an account? Sign in
Sign up for free