Relationships between probabilistic and deterministic tape complexity

Part of the Lecture Notes in Computer Science book series (LNCS, volume 118)


By giving a matrix inversion algorithm that uses a small amount of space, a result of Simon is improved: For constructible functions f(n)∉ o(logn) f(n) tape-bounded probabilistic Turing machines can be simulated on deterministic ones within (f(n))2 space.


Turing Machine Modular Representation Constructible Function Deterministic Turing Machine Nondeterministic Turing Machine 
These keywords were added by machine and not by the authors. This process is experimental and the keywords may be updated as the learning algorithm improves.


Unable to display preview. Download preview PDF.

Unable to display preview. Download preview PDF.


  1. 1.
    L. Csanky. Fast parallel matrix inversion algorithms. SIAM J. Comput. 5, 1976, pp.618–623.Google Scholar
  2. 2.
    A.K. Chandra, Kozen D.C., Stockmeyer L.J. Alternation. J.ACM 28, 1981, 114–133.Google Scholar
  3. 3.
    J.E. Hopcroft, J.D. Ullman. Formal languages and their relation to automata. Addison-Wesley, Reading, MA, 1969.Google Scholar
  4. 4.
    W.J. Savitch. Relationships between nondeterministic and deterministic tape complexity. JCSS 4, 1970, pp.177–192.Google Scholar
  5. 5.
    J. Simon. On tape-bounded probabilistic computations. Relatorio Interno No.75, Universidade Estadual de Campines (Brasil), 1977.Google Scholar
  6. 6.
    J.Simon, J.Gill, J.Hunt. On tape-bounded probabilistic Turing machine transducers. Proc. 19th IEEE FOCS, 1978, 107–112.Google Scholar

Copyright information

© Springer-Verlag Berlin Heidelberg 1981

Authors and Affiliations

  • H. Jung
    • 1
  1. 1.Sektion MathematikHumboldt-Universitat zu BerlinBerlinDDR

Personalised recommendations