Decreasing the bandwidth of a transition matrix
From MaRDI portal
Recommendations
Cites work
- scientific article; zbMATH DE number 3934409 (Why is no real title available?)
- scientific article; zbMATH DE number 3723866 (Why is no real title available?)
- scientific article; zbMATH DE number 3765145 (Why is no real title available?)
- scientific article; zbMATH DE number 3568040 (Why is no real title available?)
- scientific article; zbMATH DE number 3428547 (Why is no real title available?)
- Complexity of probabilistic versus deterministic automata
- Computational Complexity of Probabilistic Turing Machines
- Multihead two-way probabilistic finite automata
- On tape-bounded probabilistic Turing machine acceptors
- Parallel computation for well-endowed rings and space-bounded probabilistic machines
- Relationships between nondeterministic and deterministic tape complexities
- Space-bounded hierarchies and probabilistic computations
Cited in
(5)
This page was built for publication: Decreasing the bandwidth of a transition matrix
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q673904)