Deterministic simulation of tape-bounded probabilistic Turing machine transducers
From MaRDI portal
Cites work
Cited in
(6)- Space-bounded hierarchies and probabilistic computations
- Division in idealized unit cost RAMs
- A survey of space complexity
- The time-precision tradeoff problem on on-line probabilistic Turing machines
- Relationships among $PL$, $\#L$, and the determinant
- Probabilistic Turing machines and recursively enumerable Dedekind cuts
This page was built for publication: Deterministic simulation of tape-bounded probabilistic Turing machine transducers
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q1143792)