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

Start learning Write review
Boot.dev Ad

The Most Addictive Python and SQL Courses

Learn More → Coursera Ad

AI, Data Science & Cloud Certificates from Google, IBM & Meta

Learn More →

Overview

Google, IBM & Meta Certificates – 40% Off
One Coursera Plus subscription covers most Professional Certificates on Coursera.
Unlock All Certificates
This undergraduate lecture develops Savitch's Theorem and introduces nondeterministic logarithmic space (NL). It connects nondeterministic Turing-machine computation with reachability in configuration graphs and discusses space complexity classes.

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

Start learning

Never Stop Learning.

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

Sign up for free
Someone learning on their laptop while sitting on the floor.