6.046J | Spring 2012 | Undergraduate

Design and Analysis of Algorithms

Lecture Notes

6.046J Lecture 17: Complexity and NP-completeness

Description:

This resource contains information regarding complexity and NP-completeness.

Resource Type:
Lecture Notes
pdf
317 kB
6.046J Lecture 17: Complexity and NP-completeness

Course Info

Learning Resource Types
Problem Sets with Solutions
Exams with Solutions
Lecture Notes