Computational complexity is about understanding what problems can/cannot be solved with a certain amount of resources.

# News

May 24

Project guidelines have been posted.

May 22

May 8

I posted writeups for May 5-8 lectures.

May 8

Problem set 3 released.

Apr 25

Problem set 2 released.

Apr 1

Mar 26

Website draft.

# Materials

## Handouts

## Problem sets

## Resources

- Jonathan Katz lecture notes on complexity
- Jeff Erickson lecture notes (two sets of notes: "algorithms" and "models of computation")
- Luca Trevisan lecture notes on complexity
- Oded Goldreich lecture notes on complexity
- Alexander Shen lecture notes on algorithmic information theory