Register allocation: What does the NP-completeness proof of Chaitin et al. really prove (2006)

by F Bouchez, A Darte, C Guillon, F Rastello
Venue:In International Workshop on Languages and Compilers for Parallel Computing (LCPC’06), volume 4382 of LNCS