Reductions

• NP-Completeness: The Cook-Levin Theorem, Polynomial Reductions, and the Hardest Problems in NP · 2019-05-03

  A deep dive into the theory of NP-completeness—from Turing machines and the Cook-Levin theorem to the taxonomy of NP-complete problems and the P versus NP question.