Introduction to Computational Complexity - A Tutorial on Complexity Classes

Channel:
United States Fullstack Academy
Subscribers:
58,000
Published on ● Video Link: https://www.youtube.com/watch?v=Cs-ZumSw93U


Duration: 18:15
1,532 views
5

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



Other Videos By Fullstack Academy


2016-10-11B-Tree Tutorial - An Introduction to B-Trees
2016-10-11Angular Directives Examples - A Tutorial on AngularJS Directives
2016-10-06Hiring Day App Demo 10/5/16
2016-09-29C and C++ Tutorial - An Introduction to the C Programming Language
2016-09-23WebAssembly and the Future of the Browser
2016-09-22CSS Animation Tutorial - How to Implement Animation in CSS
2016-09-22FeathersJS Tutorial - How to Build a Real-Time App with Feathers
2016-09-22Tech Talk: Pass By Sharing with Javascript
2016-09-22Introduction to Java: A Brief History of the Popular Java Programming Language
2016-09-22Electron Tutorial - How to Run Native Desktop Apps with Electron
2016-09-13Introduction to Computational Complexity - A Tutorial on Complexity Classes
2016-09-13Quicksort Examples - A Tutorial on the Quicksort algorithm
2016-09-13GraphQL Tutorial - Introduction to GraphQL
2016-09-09Flashdash
2016-09-09Web Refinery
2016-09-09GAMR
2016-09-09Snipyt
2016-09-09RegEx Race
2016-09-09Cryptopass
2016-08-25Database Tutorial - SQL vs NoSQL Databases
2016-08-19Stackathon: Odyssey


Tags:
computational complexity
p=np
pokemon hardness
Complexity Classes
p vs np