VIDEO: Turing Laureate Takes On NP-Hard Problems

Richard Karp's presentation for the annual Alberto Apostolico Memorial Lecture is captured in this video posted by the College of Computing. In it, Karp – 1985 Turing Award Winner – details what he calls "a simple, yet fast heuristic algorithm" that can find perfect solutions to NP-hard problems. 

College of Computing