CS 6520 - Computational Complexity Fall 2015
Monday, September 14, 2015
Lecture 12
Razborov-Smolensky proof that Parity cannot be computed by poly-size constant depth circuits with Mod-3 gates.
Section 3.8 of
Boppana-Sipser
Newer Post
Older Post
Home