All Subjects
Light
16.1
Complexity Classes and P vs NP Problem
16.2
NP-Completeness and Cook's Theorem
16.3
Approximation Algorithms and Heuristics
16.4
Philosophical Implications of Computational Limits