Mastering Computational Complexity: A Beginner's Guide to Algorithms 📊
Discover the fundamentals of computational complexity theory and how it impacts algorithm design. Perfect for aspiring developers and computer science enthusiasts!
Grace Hopper Academy
1.1K views • Nov 18, 2016
About this video
Learn more advanced front-end and full-stack development at: https://www.fullstackacademy.com
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
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
Tags and Topics
Browse our collection to discover more content in these categories.
Video Information
Views
1.1K
Likes
11
Duration
13:37
Published
Nov 18, 2016
User Reviews
4.2
(1) Related Trending Topics
LIVE TRENDSRelated trending topics. Click any trend to explore more videos.
Trending Now