By popular demand, Assignment 1 deadline has been extended to Tuesday 9 AM. Extra credit to those who turn it in by the original deadline of 5 PM today.
Defined P/poly and showed the equivalence to languages accepted by poly-size circuits. Karp-Lipton Theorem showing that if NP is in P/poly then the polynomial time hierarchy collapses to the second level.
