YoVDO

Undergrad Complexity at CMU - Savitch's Theorem and NL

Offered By: Ryan O'Donnell via YouTube

Tags

Computational Complexity Theory Courses Recursion Courses Space Complexity Courses

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

程序设计实习 / Practice on Programming
Peking University via Coursera 程序设计基础
Peking University via edX 算法基础
Peking University via Coursera Principles of Computing (Part 2)
Rice University via Coursera 算法设计与分析 Design and Analysis of Algorithms
Peking University via Coursera