Search for tag: "reachability"

7 Media

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)	ECS 220 9b:8.5 Immerman-Szelepcsényi Theorem NSPACE(s(n)) = coNSPACE(s(n)) for s(n) ≥ log(n) space nodes reachability path algorithm node error steps bit proof paths length end graph zeros pad linear log guesses step From David Doty 0 likes 63 plays 0
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	ECS 220 8c:8.6-1 Reachability expressed logically, and as a game between prover and skeptic edge path nodes length reachability phi midpoint size quantifiers input steps graph string idea space witnesses step b1 a1 skeptic From David Doty 0 likes 19 plays 0
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	ECS 220 8c:8.4 Savitch's theorem space-bounded deterministic simulation of space-bounded nondeterminism, space usage of Savitch_s algorithm space log algorithm path nodes length graph reachability recursion n. bits half memory point root levels level node call stack From David Doty 0 likes 33 plays 0
05:46 ECS 220 8b:8.3-2 NL-WitnessExistence and… ECS 220 8b:8.3-2 NL-WitnessExistence and Reachability are NL-complete	ECS 220 8b:8.3-2 NL-WitnessExistence and Reachability are NL-complete log space input existence witness reachability reduction thing things configuration graph bits memory question urinary problem deterministically configurations element triple From David Doty 0 likes 21 plays 0
05:39 ECS 220 8b:8.3-1 NL-completeness and logspace… ECS 220 8b:8.3-1 NL-completeness and logspace reductions	ECS 220 8b:8.3-1 NL-completeness and logspace reductions space log completeness reduction reductions output problem notion reachability edge input graph nodes tape np pair thing star lot problems From David Doty 0 likes 29 plays 0
06:57 ECS 220 8b:8.2 Reachability ECS 220 8b:8.2 Reachability	ECS 220 8b:8.2 Reachability graph space reachability configuration nodes problem path machine log edges graphs size input memory node computation degree fact nondeterministic thing From David Doty 0 likes 43 plays 0
10:31 ECS 220 2a:4.2-2 k-SAT for k=1,2,3 ECS 220 2a:4.2-2 k-SAT for k=1,2,3	ECS 220 2a:4.2-2 k-SAT for k=1,2,3 clause clauses negation arrow literals formula cnf variables assignment variable p. loop graph sat reachability arrows cycle edges node b. From David Doty 0 likes 56 plays 0