CS 580's course blog
Wednesday, December 5, 2012
Lecture 38 NP complete problems
We talked about why Clique, Maximum size Independent set, and Vertex Cover are NP Complete.
No comments:
Post a Comment
Newer Post
Older Post
Home
Subscribe to:
Post Comments (Atom)
No comments:
Post a Comment