Lower Space Bounds for Randomized Computation

It is a fundamental problem in the randomized computation how to separate different randomized time or randomized space classes (c.f., e.g., [KV87, KV88]). We have separated randomized space classes below log n in [FK94]. Now we have succeeded to separate small randomized time classes for multi-tape 2-way Turing machines. Surprisingly, these “small” bounds are of type n+f(n) with f(n) not exceeding linear functions. This new approach to “sublinear” time complexity is a natural counterpart to sublinear space complexity. The latter was introduced by considering the input tape and the work tape as separate devices and distinguishing between the space used for processing information and the space used merely to read the input word from. Likewise, we distinguish between the time used for processing information and the time used merely to read the input word.

[1]  John G. Kemeny,et al.  Finite Markov Chains. , 1960 .

[2]  Richard Edwin Stearns,et al.  Hierarchies of memory limited computations , 1965, SWCT.

[3]  R. Gallager.  Information Theory and Reliable Communication , 1968 .

[4]  Namio Honda,et al.  A Context-Free Language Which is not Acceptable by a Probabilistic Automaton , 1971, Inf. Control..

[5]  John T. Gill,et al.  Computational complexity of probabilistic Turing machines , 1974, STOC '74.

[6]  Rusins Freivalds,et al.  Probabilistic Machines Can Use Less Running Time , 1977, IFIP Congress.

[7]  Rusins Freivalds,et al.  Probabilistic Two-Way Machines , 1981, MFCS.

[8]  Rusins Freivalds,et al.  Space and Reversal Complexity of Probabilistic One-Way Turing Machines , 1983, FCT.

[9]  Allan Borodin,et al.  Parallel Computation for Well-Endowed Rings and Space-Bounded Probabilistic Machines , 1984, Inf. Control..

[10]  Albert G. Greenberg,et al.  A Lower Bound for Probabilistic Algorithms for Finite State Machines , 1984, FOCS.

[11]  Viktor K. Prasanna,et al.  Information Transfer under Different Sets of Protocols , 1984, SIAM J. Comput..

[12]  Frank Thomson Leighton,et al.  Estimating a probability using finite memory , 1986, IEEE Trans. Inf. Theory.

[13]  Marek Karpinski,et al.  On the Monte Carlo Space Constructible Functions and Seperation Results for Probabilistic Complexity Classes , 1987, Inf. Comput..

[14]  Marek Karpinski,et al.  Randomness, Provability, and the Seperation of Monte Carlo Time and Space , 1987, Computation Theory and Logic.

[15]  Rusins Freivalds,et al.  Minimal Nontrivial Space Complexity of Probabilistic One-Way Turing Machines , 1990, MFCS.

[16]  Eric Allender,et al.  A Note on the Almost-Everywhere Hierarchy for Nondeterministic Time , 1990, STACS.

[17]  Richard M. Karp,et al.  An introduction to randomized algorithms , 1991, Discret. Appl. Math..

[18]  Cynthia Dwork,et al.  Finite state verifiers I: the power of interaction , 1992, JACM.

[19]  Eric Allender,et al.  Almost-Everywhere Complexity Hierarchies for Nondeterministic Time , 1993, Theor. Comput. Sci..

[20]  Ming Li,et al.  An Introduction to Kolmogorov Complexity and Its Applications , 2019, Texts in Computer Science.

[21]  Marek Karpinski,et al.  On Randomized versus Deterministic Computation , 1996, Theor. Comput. Sci..