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
Posted by Lance Fortnow at 3:49 PM
Email ThisBlogThis!Share to XShare to FacebookShare to Pinterest
Newer Post Older Post Home

Course Pages and Links

  • Course Overview
  • Planned Syllabus
  • Complexity Zoo

Blog Archive

  • ▼  2015 (44)
    • ►  December (2)
    • ►  November (11)
    • ►  October (11)
    • ▼  September (12)
      • Lecture 19
      • Lecture 18
      • Lecture 17
      • Lecture 16
      • Lecture 15
      • Lecture 14
      • Lecture 13
      • Lecture 12
      • Lecture 11
      • Lecture 10
      • Lecture 9
      • Lecture 8
    • ►  August (7)
    • ►  March (1)
Simple theme. Powered by Blogger.