15:53duration 15 minutes 53 seconds
ECS 220 9b:8.5 Immerman-Szelepcsényi…
ECS 220 9b:8.5 Immerman-Szelepcsényi Theorem NSPACE(s(n)) = coNSPACE(s(n)) for s(n) ≥ log(n)
11:57duration 11 minutes 57 seconds
ECS 220 8c:8.6-1 Reachability expressed…
ECS 220 8c:8.6-1 Reachability expressed logically, and as a game between prover and skeptic
09:03duration 9 minutes 3 seconds
ECS 220 8c:8.4 Savitch's theorem…
ECS 220 8c:8.4 Savitch's theorem space-bounded deterministic simulation of space-bounded nondeterminism, space usage of Savitch_s algorithm
05:46duration 5 minutes 46 seconds
ECS 220 8b:8.3-2 NL-WitnessExistence and…
ECS 220 8b:8.3-2 NL-WitnessExistence and Reachability are NL-complete
05:39duration 5 minutes 39 seconds
ECS 220 8b:8.3-1 NL-completeness and logspace…
ECS 220 8b:8.3-1 NL-completeness and logspace reductions
06:57duration 6 minutes 57 seconds
ECS 220 8b:8.2 Reachability
10:31duration 10 minutes 31 seconds
ECS 220 2a:4.2-2 k-SAT for k=1,2,3