6.045J | Spring 2011 | Undergraduate

Automata, Computability, and Complexity

Assignments

MIT6_045JS11_assn05.pdf

Description:

This resource contains problem sets related to NP-completeness and more.

Resource Type:
Assignments
pdf
79 kB
MIT6_045JS11_assn05.pdf

Course Info

As Taught In
Spring 2011
Learning Resource Types
Problem Sets
Lecture Notes