Support

Support Options

Submit a Support Ticket

 
Home › Resources › Online Presentations › ECE 595E Lecture 4: NP-hardness › About
This resource has a 0.0 Ranking

Ranking is calculated from a formula comprised of user reviews and usage statistics. Learn more ›

Usage Stats
Total: updated 03 May 2013
Users: 38
Reviews & Citations
Google/IEEE: updated 22 Apr 2010
Avg. Review: 0.0 out of 5 stars
Citations: 3

0 review(s) (Review this)

ECE 595E Lecture 4: NP-hardness

By Peter Bermel

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

View Presentation

Recommendations

No results found.

Powered by ...

Category

Online Presentations

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," https://nanohub.org/resources/16572.

Time

Location

EE 226, Purdue University, West Lafayette, IN

Tags

  1. course lecture
  2. Programming
  3. Simulation

Get Help

Get Involved

Legal

nanoHUB.org, a resource for nanoscience and nanotechnology, is supported by the National Science Foundation and other funding agencies.