Minimum Register Allocation is Complete in Polynomial Space

Author(s)
Loui, Michael C.
Thumbnail
DownloadMIT-LCS-TM-128.pdf (3.638Mb)
Metadata
Show full item record
Abstract
The Minimum Register Allocation Problem is to determine the minimum number of registers required to evaluate an arithmetic expression. A pebble game on directed acyclic graphs is used to prove that this is complete is complete in polynomial space.
Date issued
1979-03
URI
https://hdl.handle.net/1721.1/148956
Series/Report no.
MIT-LCS-TM-128
Collections