Computability and Computational Complexity
Turing Machines, P vs NP, decidability, complexity classes, reductions. From 1,155 classified theory files (master's course).
Prerequisites
- Discrete Mathematics
- Algorithms
What you'll learn
- Understanding the limits of calculable quantities
- Showing indecisibility through reduction
- Classify problems by P/NP/PSpace complexity.
- Recognize complex problems in practice