Theory of Computation https://uvatoc.github.io/week11 25.5 P=NP Recap - NP, NP-Hard, and NP-Complete - Proving a problem is NP-Hard - Proving P=NP - Elvis has left the building! David Evans and Nathan Brunelle University of Virginia
Right-click 'Download' and select 'Save Link As' if the file opens in a new tab.
