Explore time/space tradeoffs for SAT in this graduate-level lecture on Computational Complexity Theory. Delve into key results, technical remarks, proofs, and essential ingredients of the topic. Examine concepts such as padding, complementary speedup, and alternation elimination. Learn from Carnegie Mellon University professor Ryan O'Donnell as he covers material from Arora-Barak Chapter 5.4 in this comprehensive 92-minute session, part of CMU's Fall 2017 Course 15-855.
Time-Space Tradeoffs for SAT - Graduate Complexity Lecture at CMU
Overview
Syllabus
Introduction
Results
Technical Remarks
Proofs
Ingredients
Padding
Remarks
No Complimentary Speedup
Proof
Recap
Alternation Elimination
Alternation Trading
Taught by
Ryan O'Donnell
Related Courses
-
The Polynomial Time Hierarchy: Graduate Complexity Lecture at CMU
-
Approximate Counting - Graduate Complexity Lecture at CMU
-
More on Constant-Round Interactive Proof Systems - Graduate Complexity Lecture at CMU
-
IP = PSPACE - Graduate Complexity Lecture at CMU
-
Undergrad Complexity at CMU - SAT
-
Circuits - Graduate Complexity Lecture 4 at CMU
