Introduction to Computational Complexity - A Tutorial on Algorithms and Complexity

Computational complexity theory is a subfield of Computer Science whose goal is to classify computational problems and compare the practical difficulty of solving them. In this tutorial, we provide an introduction to Computational Complexity, before explaining one NP-hard problem (the Vertex Cover Problem), and one approach to its solution (via a linear relaxation of an integer program).

Watch this video to learn:

- What is an Algorithm
- What is Computational Complexity
- Basic complexity categories for computing problems