Class 25: NP-Complete Appetizers

Class 25 slides: [PPTX] [PDF]

Since I badly messed up the reduction from SUBSET-SUM to KNAPSACK, and don’t see an obvious way to fix this, you can solve this question in place of Problem 5 on PS6. If you get an especially elegant and convincing answer that you would like to present in class Tuesday, send it to me by Monday afternoon.

The reading handed out today is available here: The Status of the P versus NP Problem, Lance Fortnow, Communications of the ACM, September 2009.

2 comments to Class 25: NP-Complete Appetizers