Showing results for On the power of ambiguity in log-space.
Search instead for On the power of unambiguity in log-space.
For a directed acyclic graph G and a node s, we say G is k-ambiguous with respect to s, if for any node v, the number of paths from s to v is bounded by k.
Jan 12, 2010 · We investigate the complexity of min-uniqueness - a central notion in studying the \NL vs \UL problem. We show that min-uniqueness is necessary and sufficient ...
Missing: ambiguity | Show results with:ambiguity
Jan 12, 2010 · Our method can be used to show that Nspace-Ambiguity(s(n),a(n)) ⊆ Uspace(s(n) + log a(n)), thus substantially improving their upper bound. We ...
We investigate the relation between UOptL[log n] and other existing complexity classes. We consider the unambiguous hierarchies over UL and UOptL[log n]. We ...
Abstract. We investigate different variants of unambiguity in the context of computing multi-valued functions. We propose a modification to the standard ...
We show that two complexity classes introduced about two decades ago are equal. ReachUL is the class of problems decided by nondeterministic log-space ...
This paper considers learning when the distinction between risk and ambigu- ity (Knightian uncertainty) matters. Working within the framework of recursive.
May 8, 2016 · If we restrict ourselves to real arguments for the complex logarithm then we're done, and we don't even need to remark the positive real numbers ...
Missing: power space.
Jul 5, 2024 · We argue that two elementary principles of numerical cognition explain great heterogeneity in this bias, affecting consumer choices in many domains.
We investigate the ambiguity behavior of finite automata in connection with their inner structure. We show that the degree of ambiguity of a finitely ...