Description: The study of fundamental questions about the nature of computing. Topics include Turing machines, computability, reductions, complexity theo- ry, complexity classes P and NP, the P=NP problem, NP-completeness, and other time and space complexity classes.
Derived Information — The following is not part of the official catalog but is computed from catalog data.