Understanding the Complexity Class P: Foundations of Efficient Computation
Explore the fundamentals of the class P in computational complexity, including key concepts and insights from leading textbooks and lectures. Perfect for students and enthusiasts aiming to grasp efficient problem-solving ✨.
Computer Science Theory Explained
4.7K views • Feb 17, 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
4.7K
Likes
55
Duration
7:13
Published
Feb 17, 2021
User Reviews
4.4
(4) Related Trending Topics
LIVE TRENDSRelated trending topics. Click any trend to explore more videos.
Trending Now