Skip to main content
SpringerLink
Log in
Book cover

International Colloquium on Automata, Languages, and Programming

ICALP 1978: Automata, Languages and Programming pp 411–424Cite as

Parallel and nondeterministic time complexity classes

Preliminary report

  • Conference paper
  • First Online:

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

Abstract

A random access machine model that has parallel processing and string manipulation is introduced. It is shown that NP is equal to the class of sets accepted by this model in nondeterministic time 0(log n), and this result is generalized to arbitrary time classes. A well-behaved subclass of the class of parallel, nondeter-ministic programs is analyzed.

Part of this research was done while at the Mathematisch Centrum, Amsterdam. This research was supported, in part, by NSF Grant MCS-74-02338.

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. Chandra, A.K. and Stockmeyer, L.J., "Alternation," Proc. of the 17th Annual IEEE Symp. on Switching and Automata Theory, Houston, Texas, October 1976, 98–108.

    Google Scholar 

  2. Cook, S.A., and Reckhow, R.A., "Time bounded random access machines," JCSS 7 (1973), 354–375.

    Google Scholar 

  3. Hartmanis, J., "Computational complexity of random access stored program machines," Math. Systems Theory 5 (1971), 232–245.

    Article  Google Scholar 

  4. Hartmanis, J., and Simon, J., "On the power of multiplication in random access machines," Proc. of the 15th Annual IEEE Symp. on Switching and Automata Theory, New Orleans, October 1974, 13–23.

    Google Scholar 

  5. Hopcroft, J.E., and Ullman, J.D., Formal Languages and Their Relation to Automata, Addition-Wesley, Reading, MA, 1969.

    Google Scholar 

  6. Kozen, D., "On parallelism in Turing machines," Proc. of the 17th Annual IEEE Symp. on Switching and Automata Theory, Houston, Texas, October 1976, 89–97.

    Google Scholar 

  7. Pratt, V.R. and Stockmeyer, L.J., "A characterization of the power of vector machines," JCSS 12 (1976), 198–221.

    Google Scholar 

  8. Savitch, W.J. and Stimson, M.J., "Time bounded random access machines with parallel processing," JACM, (to appear).

    Google Scholar 

Download references

Author information

Authors and Affiliations

  1. Computer Science Program Department of Applied Physics and Information Science, University of California at San Diego, 92093, La Jolla, California

    Walter J. Savitch

Authors
  1. Walter J. Savitch
    View author publications

    You can also search for this author in PubMed Google Scholar

Editor information

Giorgio Ausiello Corrado Böhm

Rights and permissions

Reprints and permissions

Copyright information

© 1978 Springer-Verlag Berlin Heidelberg

About this paper

Cite this paper

Savitch, W.J. (1978). Parallel and nondeterministic time complexity classes. In: Ausiello, G., Böhm, C. (eds) Automata, Languages and Programming. ICALP 1978. Lecture Notes in Computer Science, vol 62. Springer, Berlin, Heidelberg. https://doi.org/10.1007/3-540-08860-1_31

Download citation

  • DOI: https://doi.org/10.1007/3-540-08860-1_31

  • Published:

  • Publisher Name: Springer, Berlin, Heidelberg

  • Print ISBN: 978-3-540-08860-8

  • Online ISBN: 978-3-540-35807-7

  • eBook Packages: Springer Book Archive

Publish with us

Policies and ethics

Search

Navigation