Understanding PSPACE: The Power and Limits of Polynomial Space
Explore the complexity class PSPACE with insights from top textbooks and lectures. Learn how problems are classified based on polynomial space requirements and their significance in computational theory. 🔍
Computer Science Theory Explained
5.4K views • Mar 4, 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
5.4K
Likes
90
Duration
9:51
Published
Mar 4, 2021
User Reviews
4.6
(1) Related Trending Topics
LIVE TRENDSRelated trending topics. Click any trend to explore more videos.
Trending Now