joemidgett·5 lat temu·discussI 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 lat temu·discussCheck out the course 6.042J from MIT (Mathematics for Computer Science).https://ocw.mit.edu/courses/electrical-engineering-and-compu...
joemidgett·5 lat temu·discusshttps://ccrma.stanford.edu/~jos https://www.dspguide.com https://www.willpirkle.com/about/books Musimathics Volumes 1 and 2