Storing a Sparse Table with 0(1) Worst Case Access Time
Journal of the ACM (JACM)
A very hard log-space counting class
Theoretical Computer Science - Special issue on structure in complexity theory
Using inductive counting to simulate nondeterministic computation
Information and Computation
Isolation, matching and counting uniform and nonuniform upper bounds
Journal of Computer and System Sciences
Making Nondeterminism Unambiguous
SIAM Journal on Computing
ISAAC '96 Proceedings of the 7th International Symposium on Algorithms and Computation
An Unambiguous Class Possessing a Complete Set
STACS '97 Proceedings of the 14th Annual Symposium on Theoretical Aspects of Computer Science
Unambiguity and Fewness for Logarithmic Space
FCT '91 Proceedings of the 8th International Symposium on Fundamentals of Computation Theory
NL-printable sets and nondeterministic Kolmogorov complexity
Theoretical Computer Science - Logic, language, information and computation
Directed Planar Reachability Is in Unambiguous Log-Space
ACM Transactions on Computation Theory (TOCT)
Reachability In K3,3-free graphs and K5-free graphs is in unambiguous log-space
FCT'09 Proceedings of the 17th international conference on Fundamentals of computation theory
Hi-index | 0.00 |
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.