On small space complexity classes of stochastic Turing machines and Arthur-Merlin-games

DOI10.1007/S000370050031zbMATH Open0966.68077OpenAlexW2057596590MaRDI QIDQ1590078

Maciej Liśkiewicz, K. Ruediger Reischuk

Publication date: 20 August 2001

Published in: Computational Complexity (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1007/s000370050031

zbMATH Keywords

stochastic Turing machine

Mathematics Subject Classification ID

Analysis of algorithms and problem complexity (68Q25) Formal languages and automata (68Q45) Modes of computation (nondeterministic, parallel, interactive, probabilistic, etc.) (68Q10) Complexity classes (hierarchies, relations among complexity classes, etc.) (68Q15)

This page was built for publication: On small space complexity classes of stochastic Turing machines and Arthur-Merlin-games