Making Nondeterminism Unambiguous

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

• Type: Conference
• Year: 1997
• Where: FOCS
• Authors: Klaus Reinhardt, Eric Allender
• Keywords: Complexity Classes, FOCS 1997, Nondeterministic Logarithmic Space, Nonuniform Complexity, Theoretical Computer Science