Register allocation: what does the NP-Completeness proof of Chaitin et al. really prove? (2006)

by Florent Bouchez , Alain Darte , Fabrice Rastello , Christophe Guillon
Venue:IN PROC. OF THE 19 TH INTERNATIONAL WORKSHOP ON LANGUAGES AND COMPILERS FOR PARALLEL COMPUTING (LCPC ’06
Citations:10 - 4 self