CS 6520 - Computational Complexity Fall 2017
Friday, September 1, 2017
We proved Ladner's Theorem that there exists a set A such that A is in NP, A is not in P and A is not NP-complete. Here is a
Enjoy the Labor Day weekend and see you on Wednesday.