On the Minimal Polynomial of a Matrix
COCOON '02 Proceedings of the 8th Annual International Conference on Computing and Combinatorics
Approximation of boolean functions by combinatorial rectangles
Theoretical Computer Science
The complexity of planarity testing
Information and Computation
NL-printable sets and nondeterministic Kolmogorov complexity
Theoretical Computer Science - Logic, language, information and computation
Reachability Problems: An Update
CiE '07 Proceedings of the 3rd conference on Computability in Europe: Computation and Logic in the Real World
Derandomizing the Isolation Lemma and Lower Bounds for Circuit Size
APPROX '08 / RANDOM '08 Proceedings of the 11th international workshop, APPROX 2008, and 12th international workshop, RANDOM 2008 on Approximation, Randomization and Combinatorial Optimization: Algorithms and Techniques
Directed Planar Reachability Is in Unambiguous Log-Space
ACM Transactions on Computation Theory (TOCT)
Planarity, Determinants, Permanents, and (Unique) Matchings
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
Two-way unary automata versus logarithmic space
DLT'10 Proceedings of the 14th international conference on Developments in language theory
Two-way unary automata versus logarithmic space
Information and Computation
COCOON'11 Proceedings of the 17th annual international conference on Computing and combinatorics
The directed planar reachability problem
FSTTCS '05 Proceedings of the 25th international conference on Foundations of Software Technology and Theoretical Computer Science
Space complexity of perfect matching in bounded genus bipartite graphs
Journal of Computer and System Sciences
Green's theorem and isolation in planar graphs
Information and Computation
Planarity, determinants, permanents, and (unique) matchings
CSR'07 Proceedings of the Second international conference on Computer Science: theory and applications
Log-Space Algorithms for Paths and Matchings in k-Trees
Theory of Computing Systems
Computational Complexity
On expressive power of regular realizability problems
Problems of Information Transmission
| Hi-index | 0.00 |
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, n^{O(1)}$)/poly.