6.045J | Spring 2011 | Undergraduate

Automata, Computability, and Complexity

Assignments

MIT6_045JS11_assn04.pdf

Description:

This resource contains problem sets related to polynomial-time reducibility and circuit complexity.

Resource Type:
Assignments
pdf
83 kB
MIT6_045JS11_assn04.pdf

Course Info

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