CS 6520 - Computational Complexity Fall 2015

Monday, November 2, 2015

Lecture 31

We have begun working through Irit Dinur's proof of the PCP theorem by gap amplification. Today we defined constraint graphs, stated the main theorem (Theorem 1.7) and defined expander graphs (Section 2.1).
Posted by Lance Fortnow at 10:16 AM
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)
      • Lecture 41
      • Lecture 40
      • Lecture 39
      • Lecture 38
      • Lecture 37
      • Lecture 36
      • Lecture 35
      • Lecture 34
      • Lecture 33
      • Lecture 32
      • Lecture 31
    • ►  October (11)
    • ►  September (12)
    • ►  August (7)
    • ►  March (1)
Simple theme. Powered by Blogger.