Friday, September 18, 2015

Lecture 14

Conclusion of Razborov-Smolenksy and start of Barrington's Theorem that NC1 has poly-size bounded-width branching programs. Proofs in Boppana-Sipser.

Arefin will finish that proof on Wednesday.
Posted by at