Abstract
We prove that inequalities of arithmetic expressions over the ring of n×n matrices can be decided by probabilistic Turing machines working simultaneously within 0(logn) space and polynomial time. As a corollary we obtain: PrSPACE(logn)=PrTISP(n0(1),logn), which solves a problem that has been open for a long time.
This is a preview of subscription content, log in via an institution to check access.
Preview
Unable to display preview. Download preview PDF.
References
Borodin A., Cook S.A., Pippenger N. (1983), Parallel computation for well-endowed rings and space bounded probabilistic machines. Inf. and Control 58, 113–136
Cook S.A.,(1983), The classification of problems which have fast parallel algorithms. Proc. FCT'83, LNCS 158, 78–93
Csanky L. (1976), Fast parallel matrix inversion algorithms. SIAM J. Comput. 5, 618–623
Gill J. (1977), Computational complexity of probabilistic Turing machines. SIAM J. Comput. 6, 675–695
Jung H. (1984), On probabilistic tape complexity and fast circuits for matrix inversion problems. Proc. ICALP'84, LNCS 172, 281–291
Ruzzo W.L., Simon J., Tompa M. (1982), Space-bounded hierarchies and probabilistic computations. Proc. 14th Annual ACM Symp. on Theory of Computing
Valiant L.G. (1979), The complexity of computing the permanent. Theor. Comp. Science 8, 181–201
Author information
Authors and Affiliations
Editor information
Rights and permissions
Copyright information
© 1985 Springer-Verlag Berlin Heidelberg
About this paper
Cite this paper
Jung, H. (1985). On probabilistic time and space. In: Brauer, W. (eds) Automata, Languages and Programming. ICALP 1985. Lecture Notes in Computer Science, vol 194. Springer, Berlin, Heidelberg. https://doi.org/10.1007/BFb0015756
Download citation
DOI: https://doi.org/10.1007/BFb0015756
Published:
Publisher Name: Springer, Berlin, Heidelberg
Print ISBN: 978-3-540-15650-5
Online ISBN: 978-3-540-39557-7
eBook Packages: Springer Book Archive