scientific article; zbMATH DE number 1346519
From MaRDI portal
Publication:4266543
zbMath0925.68184MaRDI QIDQ4266543
Gerhard Buntrock, Birgit Jenner, Klaus-Joern Lange, Peter Rossmanith
Publication date: 3 October 1999
Title: zbMATH Open Web Interface contents unavailable due to conflicting licenses.
Lua error in Module:PublicationMSCList at line 37: attempt to index local 'msc_result' (a nil value).
Related Items (13)
NL-printable sets and nondeterministic Kolmogorov complexity ⋮ An unambiguous class possessing a complete set ⋮ Depth-first search in directed planar graphs, revisited ⋮ On the power of unambiguity in log-space ⋮ Parallel recognition and ranking of context-free languages ⋮ Conjunctive and Boolean grammars: the true general case of the context-free grammars ⋮ Unambiguity and fewness for nonuniform families of polynomial-size nondeterministic finite automata ⋮ Isolation, matching, and counting uniform and nonuniform upper bounds ⋮ The Space Complexity of k-Tree Isomorphism ⋮ Unambiguity of circuits ⋮ NL-printable sets and Nondeterministic Kolmogorov Complexity ⋮ \textsc{ReachFewL} = \textsc{ReachUL} ⋮ Compressed Decision Problems in Hyperbolic Groups.
This page was built for publication:
