CS 6520 - Computational Complexity Fall 2017
Monday, August 28, 2017
Day 4
Cook's proof that
CNF-Satisfiability is NP-complete
Newer Post
Older Post
Home