Understanding Computational Complexity: Cook-Levin Theorem & P vs NP 🧠
Dive into Lecture 4 of CSS.203.1 to explore key topics like the Cook-Levin Theorem, decision vs. search problems, SAT self-reducibility, coNP, and padding techniques. Enhance your grasp of P vs NP and EXP vs NEXP!
STCS TIFR
465 views • Apr 22, 2021
About this video
Agenda: Cook-Levin Theorem, decision vs. search, downward self-reducibility of SAT, coNP, padding techniques: P vs NP and EXP vs NEXP
Instructor: Prahladh Harsha
Instructor: Prahladh Harsha
Video Information
Views
465
Likes
4
Duration
01:35:56
Published
Apr 22, 2021
Related Trending Topics
LIVE TRENDSRelated trending topics. Click any trend to explore more videos.