08-10-2010, 09:31 AM
Wow, and a shout out for CS 154. Thankfully the Pac-10 is rife with NP-Complete problems:
1) What is the optimum path for Lane Kiffin to take to piss off every NCAA team and NFL franchise?
2) Given a set of C.al departments, each with a budget and set of professors, and a source of income from students paying tuition and tax payers, determine the number of professors that need to be let go in order for JT to remain the highest paid employee yada yada.
3) Assuming a fixed time limit (4 15 minute quarters * 12 games) determine the offensive/defensive output from Andrew Luck, Jeremy Stewart, Owen Marecic, Ryan Whalen, and Chris Owusu in order for them to finish 1-5 in the Voldemort voting.
3b) Same question but they can finish in any order as long as each are in the top 5.
3b might be NP-hard. Truth be told CS 154 was always a bit of a mystery to me.
1) What is the optimum path for Lane Kiffin to take to piss off every NCAA team and NFL franchise?
2) Given a set of C.al departments, each with a budget and set of professors, and a source of income from students paying tuition and tax payers, determine the number of professors that need to be let go in order for JT to remain the highest paid employee yada yada.
3) Assuming a fixed time limit (4 15 minute quarters * 12 games) determine the offensive/defensive output from Andrew Luck, Jeremy Stewart, Owen Marecic, Ryan Whalen, and Chris Owusu in order for them to finish 1-5 in the Voldemort voting.
3b) Same question but they can finish in any order as long as each are in the top 5.
3b might be NP-hard. Truth be told CS 154 was always a bit of a mystery to me.

