ECE 595E Lecture 4: NP-hardness

By Peter Bermel

Electrical and Computer Engineering, Purdue University, West Lafayette, IN

Published on

Abstract

Outline:

  • Recap from Friday
  • Class NP
  • Non-deterministic Turing machines
  • Reducibility
  • Cook-Levin theorem
  • Coping with NP Hardness

Cite this work

Researchers should cite this work as follows:

  • Peter Bermel (2013), "ECE 595E Lecture 4: NP-hardness," http://nanohub.org/resources/16572.

    BibTex | EndNote

Time

Location

EE 226, Purdue University, West Lafayette, IN

Tags