Minimum Register Allocation is Complete in Polynomial Space
| dc.contributor.author | Loui, Michael C. | en_US |
| dc.date.accessioned | 2023-03-29T14:12:44Z | |
| dc.date.available | 2023-03-29T14:12:44Z | |
| dc.date.issued | 1979-03 | |
| dc.identifier.uri | https://hdl.handle.net/1721.1/148956 | |
| dc.description.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. | en_US |
| dc.relation.ispartofseries | MIT-LCS-TM-128 | |
| dc.title | Minimum Register Allocation is Complete in Polynomial Space | en_US |
| dc.identifier.oclc | 5185323 |
