Abstract
We prove two different types of complexity lower bounds for the one-way bounded-error error probabilistic space complexity. The lower bounds are proved for arbitrary languges in the common way in terms of the deterministic communication dimension of languages and in terms of the notion “probabilistic communication characteristic” of language that we define. These lower bounds are incomparable.
Our lower bounds are good enough for proving proper hierarchies for different one-way probabilistic space communication complexity classes inside SPACE(n) (namely for bounded error probabilistic computation, and for errors of probabilistic computation).
Work done in part while visiting the University of Rochester. Supported in part by a Soros grant and by the National Science Foundation under grant CCR-8957604.
This is a preview of subscription content, log in via an institution.
Preview
Unable to display preview. Download preview PDF.
References
F. Ablayev, Lower Bounds for one-way Probabilistic Communication Complexity, in Proc. of the ICALP-93, Lect. Notes in Comput. Sci., 1993, 700, 241–252.
F. Ablayev and R. Freivalds, Why sometimes probabilistic algorithms can be more effective, in Proc. of MFCS'86, Lecture Notes in Computer Science 1986, 233, 1–14.
R. Boppana and M. Sipser, The Complexity of Finite Functions. in Handbook of Theor. Comput. Sci. Edited by J. van Leeuwen, 1990, 759–801.
R. Freivalds, Complexity of Probabilistic Versus Deterministic Automata, Baltic Computer Science Selected Papers, Lect. Notes in Comput. Sci. 1991, 502, 565–613.
J. Gill, “ Computational complexity of probabilistic Turing machines,” SIAM J. Comput. 6 (1977), 675–695.
J.E. Hopcroft and J.D. Ulman, Introduction to automata theory, languages, and computation, 1979.
J. Kaneps and R. Freivalds, Minimal nontrivial space complexity of probabilistic one-way Turing machines, in Proc. of MFCS'90, Lect. Notes in Comput. Sci. 1990, 452, 355–361.
R.M. Karp, ”Some bounds on the storage requirements of sequential machines and Turing machines,” Journal of the Association for Computing Machinery 14 (1967),478–489.
R.E. Stearns, J. Hartmanis and P.M. Lewis II, “Hierarchies of memory limited computation,” 1965 IEEE Conference Record on Switching Circuit Theory and Logical Design, (1965), 179–190.
Author information
Authors and Affiliations
Editor information
Rights and permissions
Copyright information
© 1994 Springer-Verlag Berlin Heidelberg
About this paper
Cite this paper
Ablayev, F. (1994). Lower bounds for probabilistic space complexity: Communication-automata approach. In: Nerode, A., Matiyasevich, Y.V. (eds) Logical Foundations of Computer Science. LFCS 1994. Lecture Notes in Computer Science, vol 813. Springer, Berlin, Heidelberg. https://doi.org/10.1007/3-540-58140-5_1
Download citation
DOI: https://doi.org/10.1007/3-540-58140-5_1
Published:
Publisher Name: Springer, Berlin, Heidelberg
Print ISBN: 978-3-540-58140-6
Online ISBN: 978-3-540-48442-4
eBook Packages: Springer Book Archive