CS422 Theory of Computation: Reachability, Savitch's Theorem & Nondeterminism Explained 🧠
Deep dive into Chapter 5c covering the Reachability Method, Savitch's Theorem review, Nondeterminism's impact on time and memory, and the Immerman-Szelepcsényi Theorem. Perfect for mastering computational complexity!
Science and Beyond
196 views • Nov 23, 2021
About this video
00:00 Reachability Method
04:00 Review of Savitch's Theorem
26:30 Nondeterminism: Time/Memory
29:10 Immerman-Szelepscenyi Theorem: NSPACE(f) = coNSPACE(f)
34:35 Warmup: Reachability in NSPACE
49:50 UNreachability in NSPACE, knowing #Reachable
59:55 Computing #Reachable in NSPACE
04:00 Review of Savitch's Theorem
26:30 Nondeterminism: Time/Memory
29:10 Immerman-Szelepscenyi Theorem: NSPACE(f) = coNSPACE(f)
34:35 Warmup: Reachability in NSPACE
49:50 UNreachability in NSPACE, knowing #Reachable
59:55 Computing #Reachable in NSPACE
Video Information
Views
196
Likes
1
Duration
01:13:08
Published
Nov 23, 2021
Related Trending Topics
LIVE TRENDSRelated trending topics. Click any trend to explore more videos.
Trending Now