Cracking the Toughest Challenges in NP - Georgia Tech's Complexity Theory 📚
Explore the most difficult problems in NP with Georgia Tech's comprehensive course on Computability and Complexity. Watch now on Udacity and deepen your understanding of theoretical computer science!
Udacity
5.7K views • Feb 23, 2015
About this video
Watch on Udacity: https://www.udacity.com/course/viewer#!/c-ud061/l-3474368615/m-2468098549
Check out the full Advanced Operating Systems course for free at: https://www.udacity.com/course/ud061
Georgia Tech online Master's program: https://www.udacity.com/georgia-tech
Check out the full Advanced Operating Systems course for free at: https://www.udacity.com/course/ud061
Georgia Tech online Master's program: https://www.udacity.com/georgia-tech
Tags and Topics
Browse our collection to discover more content in these categories.
Video Information
Views
5.7K
Likes
42
Duration
3:25
Published
Feb 23, 2015
User Reviews
4.1
(1) Related Trending Topics
LIVE TRENDSRelated trending topics. Click any trend to explore more videos.
Trending Now