CS 6520 - Computational Complexity Fall 2015

Wednesday, November 18, 2015

Lecture 38

Conclude lecture series on PCP theorem with Proof of BLR test and PCP systems for quadratic-SAT.

Posted by Lance Fortnow at 11:26 AM

Email This BlogThis!Share to X Share to Facebook Share 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.