Understanding NP-Complete Problems: Key Concepts and Resources 📘
Explore the fundamentals of NP-complete problems with insights from top textbooks and lecture materials. Perfect for students and enthusiasts aiming to grasp computational complexity.
Computer Science Theory Explained
1.7K views • Feb 22, 2021
About this video
Textbooks:
Computational Complexity: A Modern Approach by S. Arora and B. Barak.
Algorithm Design by J. Kleinberg and E. Tardos.
Lecture slides by K. Wayne accompanying the latter textbook:
https://www.cs.princeton.edu/~wayne/kleinberg-tardos/
Computational Complexity: A Modern Approach by S. Arora and B. Barak.
Algorithm Design by J. Kleinberg and E. Tardos.
Lecture slides by K. Wayne accompanying the latter textbook:
https://www.cs.princeton.edu/~wayne/kleinberg-tardos/
Video Information
Views
1.7K
Likes
22
Duration
6:42
Published
Feb 22, 2021
User Reviews
4.4
(1) Related Trending Topics
LIVE TRENDSRelated trending topics. Click any trend to explore more videos.