scientific article; zbMATH DE number 18635
From MaRDI portal
Publication:3976039
zbMATH Open0762.68019MaRDI QIDQ3976039FDOQ3976039
Authors: Jānis Kaņeps, Rūsiņš Freivalds 
Publication date: 26 June 1992
Title of this publication is not available (Why is that?)
Recommendations
Cited In (25)
- A space lower bound for acceptance by one-way \(\Pi_2\)-alternating machines
- Hartmanis-Stearns Conjecture on Real Time and Transcendence
- Automaticity. II: Descriptional complexity in the unary case
- Geometric problems on two-dimensional array processors
- Title not available (Why is that?)
- Uncountable classical and quantum complexity classes
- Lower space bounds for randomized computation
- Computational power of one-way Turing machines with sublogarithmic memory restrictions
- With probability one, a random oracle separates PSPACE from the polynomial-time hierarchy
- A sufficient condition to polynomially compute a minimum separating DFA
- Minimal cover-automata for finite languages
- Lower bounds for one-way probabilistic communication complexity and their application to space complexity
- Complexity of probabilistic versus deterministic automata
- One-way bounded-error probabilistic pushdown automata and Kolmogorov complexity (preliminary report)
- Automaticity. IV: Sequences, sets, and diversity
- Regular Growth Automata: Properties of a Class of Finitely Induced Infinite Machines
- The online space complexity of probabilistic languages
- Lower time bounds for randomized computation
- On languages accepted with simultaneous complexity bounds and their ranking problem
- Title not available (Why is that?)
- Title not available (Why is that?)
- Theory of one-tape linear-time Turing machines
- Title not available (Why is that?)
- A note on off-line machines with 'Brownian' input heads
- Title not available (Why is that?)
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 Q3976039)
