Support Options

Submit a Support Ticket

Home Online Presentations ECE 595E Lecture 4: NP-hardness Watch Presentation

ECE 595E Lecture 4: NP-hardness

By Peter Bermel

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

Published on



  • 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,"

    BibTex | EndNote



EE 226, Purdue University, West Lafayette, IN


Oops, We Encountered an Error.

Use the error messages below to try and resolve the issue. If you are still unable to fix the problem report your problem to the system administrator by entering a support ticket.

  1. Unable to find presentation., a resource for nanoscience and nanotechnology, is supported by the National Science Foundation and other funding agencies. Any opinions, findings, and conclusions or recommendations expressed in this material are those of the author(s) and do not necessarily reflect the views of the National Science Foundation.