15:53

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:57

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:03

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:46

ECS 220 8b:8.3-2 NL-WitnessExistence and…

ECS 220 8b:8.3-2 NL-WitnessExistence and Reachability are NL-complete

05:39

ECS 220 8b:8.3-1 NL-completeness and logspace…

ECS 220 8b:8.3-1 NL-completeness and logspace reductions

06:57

ECS 220 8b:8.2 Reachability

10:31

ECS 220 2a:4.2-2 k-SAT for k=1,2,3

AggieVideo video portal by Academic Technology ServicesUC Davis | Information and Educational Technology | User Guides and Technical Documentation