Making nondeterminism unambiguous
Making nondeterminism unambiguous
Summary: 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 \[ \begin{aligned} \text{NL/poly} &= \text{UL/poly},\\ \text{LogCFL/poly}&= \text{UAuxPDA}(\log n, n^{O(1)})/ \text{poly}\end{aligned} \] {}.
- Rutgers, The State University of New Jersey United States
- University of Tübingen Germany
ULOG, nondeterministic space, Complexity classes (hierarchies, relations among complexity classes, etc.), Modes of computation (nondeterministic, parallel, interactive, probabilistic, etc.), NLOG, LogCFL, unambiguous computation
ULOG, nondeterministic space, Complexity classes (hierarchies, relations among complexity classes, etc.), Modes of computation (nondeterministic, parallel, interactive, probabilistic, etc.), NLOG, LogCFL, unambiguous computation
selected citations These citations are derived from selected sources.This is an alternative to the "Influence" indicator, which also reflects the overall/total impact of an article in the research community at large, based on the underlying citation network (diachronically).57 popularity This indicator reflects the "current" impact/attention (the "hype") of an article in the research community at large, based on the underlying citation network.Top 10% influence This indicator reflects the overall/total impact of an article in the research community at large, based on the underlying citation network (diachronically).Top 10% impulse This indicator reflects the initial momentum of an article directly after its publication, based on the underlying citation network.Top 10%
Citations provided by BIP!Popularity provided by BIP!