« Course SySyllabus for all sect | Main | VS 2005 aSyllabus for all sect »
January 13, 2006
Lecture #Syllabus for all sect
Zero or more sections of CS 312 students may find these notes useful. Remember that in the long run, the main idea from today's class was that "a problem is NP-complete means there is no efficient algorithm to solve the problem" (assuming P not = NP).
Posted by jones at January 13, 2006 12:55 PM
Comments
Post a comment
Thanks for signing in, . Now you can comment. (sign out)
(If you haven't left a comment here before, you may need to be approved by the site owner before your comment will appear. Until then, it won't appear on the entry. Thanks for waiting.)