Mastering Computational Complexity: Promise Problems & Unique-SAT Explained 🧠
Dive into Lecture 17 of CSS.203.1 to explore promise problems, the Unique-SAT challenge, the Valiant-Vazirani Lemma, and an introduction to #P complexity with instructor Ramprasad Saptharishi.
STCS TIFR
187 views • Apr 22, 2021
About this video
Agenda: Promise problems; Unique-SAT; the Valiant-Vazirani Lemma; introduction to #P
Instructor: Ramprasad Saptharishi
Instructor: Ramprasad Saptharishi
Video Information
Views
187
Likes
1
Duration
01:31:31
Published
Apr 22, 2021
Related Trending Topics
LIVE TRENDSRelated trending topics. Click any trend to explore more videos.
Trending Now