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.
[...] This post was mentioned on Twitter by darnell. darnell said: Class 25: NP-Complete Appetizers «cs3102: Theory of Computation: Class 25: NP-Complete Appetizers. Class 25 slides… http://bit.ly/akDdH2 [...]
http://www.cs.umd.edu/~gasarch/papers/poll.pdf
This “survey” conducted by the University of Rochester asks 100 researchers about their personal predictions for the P vs. NP problem. They’ve got some pretty big names in there (Sipser gives his prediction at comment 47, and Conway, as in Conways “Game of Life”, chimes in at 9.)