CS 580's course blog
Wednesday, November 28, 2012
Lecture 35. NP Completeness
Today, we talked about the definition of P, NP and polynomial time reducible.
No comments:
Post a Comment
Newer Post
Older Post
Home
Subscribe to:
Post Comments (Atom)
No comments:
Post a Comment