Complexity Theory

I proved for a class project that Instruction Scheduling on a Pipeline with precedence constraints between pipeline stages of jobs is NP-hard for an unbounded number of processors.

This project was done during the spring of 2010 for the course COT 6410 (Complexity Theory) at the University of Central Florida.

Download the files