joemidgett·4 年前·議論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.
joemidgett·5 年前·議論Check out the course 6.042J from MIT (Mathematics for Computer Science).https://ocw.mit.edu/courses/electrical-engineering-and-compu...