CS 6520 - Computational Complexity Fall 2015

Friday, October 9, 2015

Lecture 23

Proof that the Permanent is #P-complete (Valiant's Paper)
Posted by Lance Fortnow at 10:09 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)
    • ▼  October (11)
      • Lecture 30
      • Lecture 29
      • Lecture 28
      • Lecture 27
      • Lecture 26
      • Lecture 25
      • Lecture 24
      • Lecture 23
      • Lecture 22
      • Lecture 21
      • Lecture 20
    • ►  September (12)
    • ►  August (7)
    • ►  March (1)
Simple theme. Powered by Blogger.