Search for tag: "reachability"

ECS 220 9b:8.5 Immerman-Szelepcsényi Theorem NSPACE(s(n)) = coNSPACE(s(n)) for s(n) ≥ log(n)

+19 More
From  David Doty 0 likes 82 plays 0  

ECS 220 8c:8.6-1 Reachability expressed logically, and as a game between prover and skeptic

+19 More
From  David Doty 0 likes 25 plays 0  

ECS 220 8c:8.4 Savitch's theorem space-bounded deterministic simulation of space-bounded nondeterminism, space usage of Savitch_s algorithm

+19 More
From  David Doty 0 likes 39 plays 0  

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

+19 More
From  David Doty 0 likes 28 plays 0  

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

+19 More
From  David Doty 0 likes 39 plays 0  

ECS 220 8b:8.2 Reachability

+19 More
From  David Doty 0 likes 53 plays 0  

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

+19 More
From  David Doty 0 likes 84 plays 0