CS 6520 - Computational Complexity Fall 2015

Monday, August 24, 2015

Lecture 4

Mahaney's Theorem: There are no sparse NP-complete sets unless P = NP

Introduced oracle Turing machines. Next class: Baker-Gill-Solovay
Posted by Lance Fortnow at 10:17 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)
    • ►  September (12)
    • ▼  August (7)
      • Lecture 7
      • Lecture 6
      • Lecture 5
      • Lecture 4
      • Lecture 3
      • Lecture 2
      • Lecture 1
    • ►  March (1)
Simple theme. Powered by Blogger.