Computational Complexity
Oregon State University, Spring 2017

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


May 24
Project guidelines have been posted.
May 8
I posted writeups for May 5-8 lectures.
May 8
Problem set 3 released.
Apr 25
Problem set 2 released.
Apr 1
Mike will be out of town for the first week of class. You should use this opportunity to refresh Turing machines and the undecidability of the halting problem. Refer to Erickson's models of computation notes, sections 6, 7, 8.
Mar 26
Website draft.



Problem sets