Class Central is learner-supported. When you buy through links on our site, we may earn an affiliate commission.

YouTube

Undergrad Complexity at CMU - Savitch's Theorem and NL

Ryan O'Donnell via YouTube

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

Reviews

Start your review of Undergrad Complexity at CMU - Savitch's Theorem and NL

Never Stop Learning.

Get personalized course recommendations, track subjects and courses with reminders, and more.

Someone learning on their laptop while sitting on the floor.