CS 6520 - Computational Complexity Fall 2017
Wednesday, September 27, 2017
Assignment 2 now available on the T-Square site. Due October 11.
Defined circuits, size and depth. Showed that a language has a polynomial-size circuit family if and only if L is in P/poly.