CS 6520 - Computational Complexity Fall 2015

Wednesday, September 30, 2015

Lecture 19

Lautemann's proof that BPP is in Σp2∩Πp2.

Informal notion of Merlin-Arthur games and example of proof of graph non-isomorphism.
Posted by Lance Fortnow at 4:32 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.