Sciweavers

ECCC
2011

ReachFewL = ReachUL

12 years 7 months ago
ReachFewL = ReachUL
We show that two complexity classes introduced about two decades ago are equal. ReachUL is the class of problems decided by nondeterministic log-space machines which on every input have at most one computation path from the start configuration to any other configuration. ReachFewL, a natural generalization of ReachUL, is the class of problems decided by nondeterministic log-space machines which on every input have at most polynomially many computation paths from the start configuration to any other configuration. We show that ReachFewL = ReachUL.
Brady Garvin, Derrick Stolee, Raghunath Tewari, N.
Added 27 Aug 2011
Updated 27 Aug 2011
Type Journal
Year 2011
Where ECCC
Authors Brady Garvin, Derrick Stolee, Raghunath Tewari, N. V. Vinodchandran
Comments (0)