Skip to main content
SpringerLink
Log in
Book cover

International Symposium on Mathematical Foundations of Computer Science

MFCS 1989: Mathematical Foundations of Computer Science 1989 pp 370–379Cite as

Oracle branching programs and Logspace versus P

  • Communications
  • Conference paper
  • First Online:

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

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

Preview

Unable to display preview. Download preview PDF.

Unable to display preview. Download preview PDF.

References

  1. R. Aleliunas, R. Karp, R. Lipton, L. Lovasz and C. Rackoff, Random walks, universal traversal sequences, and the complexity of maze problems, Proc. of the 20th IEEE Symp. on the Foundations of Computer Science (1979), pp. 218–233.

    Google Scholar 

  2. D.A. Mix Barrington and P. McKenzie, Oracle branching programs and Logspace versus P, Rapport technique #672, DIRO, Univ. de Montréal, 1989.

    Google Scholar 

  3. A. Borodin, D. Dolev, F. Fich and W. Paul, Bounds for width-two branching programs, Proc. of the 15th ACM Symp. on the Theory of Computing (1983), pp. 97–93.

    Google Scholar 

  4. A. Borodin, M.J. Fisher, D.G. Kirkpatrick, N.A. Lynch and M. Tompa, A time-space tradeoff for sorting on non-oblivious machines, Proc. of the 20th IEEE Symp. on the Foundations of Computer Science (1979), pp. 319–327.

    Google Scholar 

  5. A. Chandra, M. Furst and R. Lipton, Multi-party protocols, Proc. of the 15th ACM Symp. on the Theory of Computing (1983), pp. 94–99.

    Google Scholar 

  6. S.A. Cook, An observation on time-storage trade-off, J. Computer and Systems ScienceVol. 9, no. 3 (1974), pp. 308–316.

    Google Scholar 

  7. S.A. Cook, Towards a complexity theory of synchronous parallel computation, in L'enseignement mathématique, Série II, Tome XXVII, fasc. 1–2 (1981).

    Google Scholar 

  8. S.A. Cook, A taxonomy of problems with fast parallel solutions, Information and Computation64 (1985), pp. 2–22.

    Google Scholar 

  9. S.A. Cook and P. McKenzie, Problems complete for deterministic logarithmic space, J. of Algorithms8 (1987), pp. 385–394.

    Google Scholar 

  10. J.E. Hopcroft and J.D. Ullman, Introduction to Automata Theory, Languages, and Computation, Addison-Wesley (1979).

    Google Scholar 

  11. N. Immerman, Nondeterministic space is closed under complement, Proc. of the 3rd Structure in Complexity Conference (1988), IEEE Computer Society Press, pp. 112–115.

    Google Scholar 

  12. N.D. Jones, Space-bounded reducibility among combinatorial problems, J. Computer and Systems Science11 (1975), pp. 68–85.

    Google Scholar 

  13. N.D. Jones and W.T. Laaser, Complete problems for deterministic polynomial time, Theoretical Computer Science3 (1977), pp. 105–117.

    Google Scholar 

  14. N.D. Jones, E. Lien and W.T. Laaser, New problems complete for nondeterministic log space, Math. Systems Theory10 (1976), pp. 1–17.

    Google Scholar 

  15. R. Karp, E. Upfal and A. Wigderson, The complexity of parallel search, J. Computer and Systems Science36 (1988), pp. 225–253.

    Google Scholar 

  16. D. Kozen, Lower bounds for natural proof systems, Proc. of the 18th ACM Symp. on the Theory of Computing (1977), pp. 254–266.

    Google Scholar 

  17. R.E. Lander, The circuit value problem is log space somplete for P, SIGACT News7 No. 1 (1975), pp. 18–20.

    Google Scholar 

  18. C.Y. Lee Representation of switching functions by binary decision programs, Bell Systems Technical Journal 38 (1959), pp. 985–999.

    Google Scholar 

  19. W. Masek, A fast algorithm for the string editing problem and decision graph complexity, M. Sc. Thesis, M.I.T. (May 1976).

    Google Scholar 

  20. P. McKenzie and D. Thérien, Automata theory meets circuit complexity, Proc. of the 16th International Colloquium on Automata, Languages and Programming, Springer Lecture Notes in Comp. Sci. xx (1989), pp. xx–xx.

    Google Scholar 

  21. N. Pippenger, On simultaneous resource bounds, Proc. of the 20th IEEE Symp. on the Foundations of Computer Science (1979), pp. 307–311.

    Google Scholar 

  22. W.J. Savitch, Relationship between nondeterministic and deterministic tape complexities, J. Computer and Systems Science4 (1970), pp. 177–192.

    Google Scholar 

  23. R. Szelepcsényi, The method of forcing for nondeterministic automata, Bull. European Assoc. for Theor. Comp. Sci. (Oct. 1987), pp. 96–100.

    Google Scholar 

Download references

Author information

Authors and Affiliations

  1. Dept. of Computer and Information Science, University of Massachusetts, 01003, Amherst, Massachusetts, USA

    David A. Mix Barrington

  2. Dép. d'informatique et de recherche opérationnelle, Université de Montréal, C.P. 6128 “A”, H3C 3J7, Montréal, Québec, Canada

    Pierre McKenzie

Authors
  1. David A. Mix Barrington
    View author publications

    You can also search for this author in PubMed Google Scholar

  2. Pierre McKenzie
    View author publications

    You can also search for this author in PubMed Google Scholar

Editor information

Antoni Kreczmar Grazyna Mirkowska

Rights and permissions

Reprints and permissions

Copyright information

© 1989 Springer-Verlag Berlin Heidelberg

About this paper

Cite this paper

Barrington, D.A.M., McKenzie, P. (1989). Oracle branching programs and Logspace versus P. In: Kreczmar, A., Mirkowska, G. (eds) Mathematical Foundations of Computer Science 1989. MFCS 1989. Lecture Notes in Computer Science, vol 379. Springer, Berlin, Heidelberg. https://doi.org/10.1007/3-540-51486-4_84

Download citation

  • DOI: https://doi.org/10.1007/3-540-51486-4_84

  • Published:

  • Publisher Name: Springer, Berlin, Heidelberg

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

  • Online ISBN: 978-3-540-48176-8

  • eBook Packages: Springer Book Archive

Publish with us

Policies and ethics

Search

Navigation