scientific article; zbMATH DE number 1072535
From MaRDI portal
Publication:4359462
zbMATH Open0880.68043MaRDI QIDQ4359462FDOQ4359462
Authors: Maciej Liśkiewicz, Rüdiger Reischuk
Publication date: 7 January 1998
Title of this publication is not available (Why is that?)
Recommendations
Cited In (17)
- On the structure of log-space probabilistic complexity classes (extended abstract)
- Title not available (Why is that?)
- Uniform constant-depth threshold circuits for division and iterated multiplication.
- Separating complexity classes related to certain input oblivious logarithmic space-bounded Turing machines
- The Sublogarithmic Alternating Space World
- Space hierarchy results for randomized and other semantic models
- An alternating hierarchy for finite automata
- Title not available (Why is that?)
- Title not available (Why is that?)
- Bridging across the \(\log (n)\) space frontier
- Turing machines with sublogarithmic space
- Regressive computations characterize logarithmic space
- Complement for two-way alternating automata
- A survey of space complexity
- Computation with Narrow CTCs
- Lower time bounds for randomized computation
- On small space complexity classes of stochastic Turing machines and Arthur-Merlin-games
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 Q4359462)