Introduction to Computational Complexity - A Tutorial on Complexity Classes

Learn more advanced front-end and full-stack development at: https://www.fullstackacademy.com Computational Complexity Theory is a branch of theoretical computer science that aims to classify computational problems according to their inherent difficulty, and then relate those classes to each other. Complexity Classes are basically a way of grouping problems together. Problems can be grouped by their time complexity or space complexity. Watch this video to learn: - What are Complexity Classes - P vs NP - A proof of the Computational Complexity of the popular Nintendo video game Pokemon