scientific article; zbMATH DE number 1346519
From MaRDI portal
Publication:4266543
zbMATH Open0925.68184MaRDI QIDQ4266543FDOQ4266543
Klaus-Jörn Lange, Gerhard Buntrock, Peter Rossmanith, Birgit Jenner
Publication date: 3 October 1999
Title of this publication is not available (Why is that?)
Automata and formal grammars in connection with logical questions (03D05) Complexity classes (hierarchies, relations among complexity classes, etc.) (68Q15) Complexity of computation (including implicit computational complexity) (03D15) Turing machines and related notions (03D10)
Cited In (14)
- Depth-first search in directed planar graphs, revisited
- Parallel recognition and ranking of context-free languages
- Conjunctive and Boolean grammars: the true general case of the context-free grammars
- StUSPACE(log n) ⊂-DSPACE(log2 n/log log n)
- An unambiguous class possessing a complete set
- Unambiguity and fewness for nonuniform families of polynomial-size nondeterministic finite automata
- \textsc{ReachFewL} = \textsc{ReachUL}
- NL-printable sets and Nondeterministic Kolmogorov Complexity
- Isolation, matching, and counting uniform and nonuniform upper bounds
- Unambiguity of circuits
- On the power of unambiguity in log-space
- Compressed Decision Problems in Hyperbolic Groups.
- NL-printable sets and nondeterministic Kolmogorov complexity
- The Space Complexity of k-Tree Isomorphism
This page was built for publication:
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q4266543)
