Hacker News new | ask | show | jobs
by joemidgett 1618 days ago
I recently read the book: "The Algorithm Design Manual" by Skiena. Chapter 11 is a good resource for this line of inquiry concerning reductions/translations between problems and NP-Completeness.
1 comments
eru 1618 days ago
I'm glad you got something out of 'The Algorithm Design Manual'. Alas, I found that book exceedingly fluffy.

Compare http://jeffe.cs.illinois.edu/teaching/algorithms/ perhaps for something more meaty.

link