Abstract
We show that in the context of nonuniform complexity, nondeterministic logarithmic space bounded computation can be made unambiguous. An analogous result holds for the class of problems reducible to context-free languages. In terms of complexity classes, this can be stated as NL/poly = UL/poly, LogCFL/poly = UAuxPDA(log n, nO(1))/poly.
Cite
CITATION STYLE
APA
Reinhardt, K., & Allender, E. (2000). Making nondeterminism unambiguous. SIAM Journal on Computing, 29(4), 1118–1131. https://doi.org/10.1137/S0097539798339041
Register to see more suggestions
Mendeley helps you to discover research relevant for your work.
Already have an account? Sign in
Sign up for free