Skip to main content
SpringerLink
Log in

On probabilistic tape complexity and fast circuits for matrix inversion problems

Extended abstract

  • Conference paper
  • First Online:
Book cover Automata, Languages and Programming (ICALP 1984)

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

Included in the following conference series:

This is a preview of subscription content, log in via an institution to check access.

Access this chapter

Log in via an institution

Institutional subscriptions

Preview

Unable to display preview. Download preview PDF.

Unable to display preview. Download preview PDF.

References

  1. R.Aleliunes, R.M.Karp, R.J.Lipton, L.Lovasz, Random walks, universal traversal sequences and the complexity of maze problems. 20th Annual Symposium on Foundations of Computer Science, 1979, 218–223

    Google Scholar 

  2. A. Borodin, On relating time and space to size and depth. SIAM J. Computing 6 (1977), 733–744

    Google Scholar 

  3. A.Borodin, S.Cook, N.Pippenger, Parallel computation for wellendowed rings and space-bounded probabilistic machines. TR#162/83, Dept. of Comp. Sci., University of Toronto, 1983

    Google Scholar 

  4. A. Borodin, J. von zur Gathen, J.E. Hopcroft, Fast parallel matrix and god computations. Information and Control 52, 3 (1982), 241–256

    Google Scholar 

  5. L. Csanky, Fast parallel matrix inversion algorithms. SIAM J. Computing 5 (1976), 618–623

    Google Scholar 

  6. R.V. Freivals, Probabilistic two-way machines. 10th Symposium on Mathematical Foundations of Computer Science, 1981, LNCS 118, 33–45

    Google Scholar 

  7. J. Gill, Computational complexity of probabilistic Turing machines. SIAM J. Computing 6 (1977), 675–695

    Google Scholar 

  8. J.H. Hopcroft, J.D. Ullman, Formal languages and their relation to automata. Addison-Wesley, Reading MA, 1969

    Google Scholar 

  9. H.Jung, Relationships between probabilistic and deterministic tape complexity. 10th Symposium on Mathematical Foundations of Computer Science, 1981, LNCS 118, 339–346

    Google Scholar 

  10. B.Monien, I.H.Sudborough, On elimating nondeterminism from Turing machines which use less than logarithm worktape space. 6th Coll. on Automata, Languages and Programming, 1979, LNCS 71, 431–445

    Google Scholar 

  11. J.H. Reif, Logarithmic depth circuits for algebraic functions. TR-35-82, Harvard Un., Aiken Comp. Lab., Cambridge MA, 1982

    Google Scholar 

  12. W.L. Ruzzo, On uniform circuit complexity. Journal of Computer and System Sciences 22 (1981), 365–383

    Google Scholar 

  13. W.L.Ruzzo, J.Simon, M.Tompa, Space-bounded hierarchies and probabilistic computations. 14th Annual ACM Symposium on Theory of Computing, 1982

    Google Scholar 

  14. J.Simon, On the difference between one and many. 4th Coll. on Automata, Languages and Programming, 1977, LNCS 52, 480–491

    Google Scholar 

  15. J.Simon, Space-bounded probabilistic Turing machine complexity classes are closed under complement. 13th Annual ACM Symposium on Theory of Computing, 1981, 158–167

    Google Scholar 

Download references

Author information

Authors and Affiliations

  1. Sektion Mathematik, Humboldt-Universität zu Berlin, PSF 1297, DDR - 1086, Berlin

    Hermann Jung

Authors
  1. Hermann Jung
    View author publications

    You can also search for this author in PubMed Google Scholar

Editor information

Jan Paredaens

Rights and permissions

Reprints and permissions

Copyright information

© 1984 Springer-Verlag Berlin Heidelberg

About this paper

Cite this paper

Jung, H. (1984). On probabilistic tape complexity and fast circuits for matrix inversion problems. In: Paredaens, J. (eds) Automata, Languages and Programming. ICALP 1984. Lecture Notes in Computer Science, vol 172. Springer, Berlin, Heidelberg. https://doi.org/10.1007/3-540-13345-3_25

Download citation

  • DOI: https://doi.org/10.1007/3-540-13345-3_25

  • Published:

  • Publisher Name: Springer, Berlin, Heidelberg

  • Print ISBN: 978-3-540-13345-2

  • Online ISBN: 978-3-540-38886-9

  • eBook Packages: Springer Book Archive

Publish with us

Policies and ethics

Search

Navigation