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
Newer Post
Older Post
Home