It is a fundamental open problem in the randomized computation how to separate different randomized time or randomized small space classes (cf., e.g., [KV 87], [KV 88]). In this paper we study lower space bounds for randomized computation, and prove lower space bounds up to log n for the specific sets computed by the Monte Carlo Turing machines. This enables us for the first time, to separate randomized space classes below log n (cf. [KV 87], [KV 88]), allowing us to separate, say, the randomized space O (1) from the randomized space O (log*n). We prove also lower space bounds up to log log n and log n, respectively, for specific sets computed by probabilistic Turing machines, and one-way probabilistic Turing machines.
CITATION STYLE
Freivalds, R., & Karpinski, M. (1994). Lower space bounds for randomized computation. In Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics) (Vol. 820 LNCS, pp. 580–592). Springer Verlag. https://doi.org/10.1007/3-540-58201-0_100
Mendeley helps you to discover research relevant for your work.