VIDEO: Turing Laureate Takes On NP-Hard Problems

External News Details
  • Richard M. Karp Richard M. Karp

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. 

Additional Information


College of Computing, School of Computer Science

No categories were selected.
No keywords were submitted.
  • Created By: Ben Snedeker
  • Workflow Status: Published
  • Created On: Mar 16, 2017 - 4:36pm
  • Last Updated: Mar 16, 2017 - 4:37pm