Theory of Computation - Page 5 Topic 14. P and NP, SAT, Poly-Time ReducibilityLecture Notes Topic 15. NP-CompletenessLecture Notes Topic 16. Cook-Levin TheoremLecture Notes Bookmarks Page 1 Page 2 Page 3 Page 4 Page 5 Page 6 Page 7 Page 8 Page 9
0 Comments
Post a Comment