Undergrad Complexity at CMU - Savitch's Theorem and NL

Offered By: Ryan O'Donnell via YouTube

Course Description

Overview

Explore Savitch's Theorem and NL in this undergraduate Computational Complexity Theory lecture from Carnegie Mellon University's Course 15-455. Delve into topics such as pseudocode, space complexity, recursion, and NL codecorrectness. Learn from Professor Ryan O'Donnell as he covers the remaining portions of Sipser Ch. 8.1 and 8.4. Gain valuable insights into this fundamental theorem and its implications for nondeterministic logarithmic space complexity.

Syllabus

Introduction
Savitchs Theorem
Pseudocode
Space Complexity
Recursion
NL
Code
correctness

Taught by

Ryan O'Donnell

Related Courses

理论计算机科学基础 | Introduction to Theoretical Computer Science
Peking University via edX 算法设计与分析(高级) | Advanced Design and Analysis of Algorithms
Peking University via edX The Introduction to Quantum Computing
Saint Petersburg State University via Coursera Computational Complexity Theory
Indian Institute of Technology Kanpur via Swayam Computational Complexity
IIT Hyderabad via Swayam