Skip to main content
SpringerLink
Log in

A hierarchy theorem for pram-based complexity classes

  • Session 7 Complexity
  • Conference paper
  • First Online:
Foundations of Software Technology and Theoretical Computer Science (FSTTCS 1988)

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

Abstract

The main result in this paper is to show that P j T i ⊂ P j+l T i+k, that is, the PT-hierarchy is a proper hierarchy (i.e., it does not collapse). Here P j T i denotes the class of languages accepted by a PRAM using O(n j) processors and O(logi n) parallel steps. It is also (implicitly) shown in this paper that NC \(\subseteq\) PT(uniform) thus improving on Stockmeyer and Vishkin's result [6] that NC \(\subseteq\) PT(non-uniform).

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. Batcher, K., Sorting Networks and Their Applications, 1968 Spring Joint Computer Conference, AFIPS Proceedings, Vol. 32, 1968, pp. 307–314.

    Google Scholar 

  2. Hopcroft, J. and Ullman, J., Introduction to Automata Theory, Languages, and Computation, Addison-Wesley, Reading, Massachusetts, 1979.

    Google Scholar 

  3. Kirchherr, W., Reversal Bounded Turing Machines, Ph.D. Thesis, Research Report in Computer Science No. 29, Department of Mathematics, Statistics and Computer Science, University of Illinois at Chicago, February, 1988.

    Google Scholar 

  4. Pippenger, N., On Simultaneous Resource Bounds (Preliminary Version), 20th Proceedings of IEEE Symposium on the Foundations of Computer Science, 1979, pp. 307–311.

    Google Scholar 

  5. Pippenger, N. and Fischer, M., Relations Among Comlexity Measures, Journal of the ACM, Vol. 26, No. 2, April, 1979, pp. 361–381.

    Google Scholar 

  6. Stockmeyer, L. and Vishkin, U., Simulation of Parallel Random Access Machines by Circuits, SIAM Journal of Computing, Vol. 13, No. 2, May, 1984, pp. 409–422.

    Google Scholar 

  7. Stone, H., Parallel Processing with the Perfect Shuffle, IEEE Transactions on Computers, Vol. c-20, No. 2, February, 1971, pp. 153–161.

    Google Scholar 

Download references

Author information

Authors and Affiliations

  1. Department of Mathematics and Computer Science, San Jose State University, 95112, San Jose, California

    Walter W. Kirchherr

Authors
  1. Walter W. Kirchherr
    View author publications

    You can also search for this author in PubMed Google Scholar

Editor information

Kesav V. Nori Sanjeev Kumar

Rights and permissions

Reprints and permissions

Copyright information

© 1988 Springer-Verlag Berlin Heidelberg

About this paper

Cite this paper

Kirchherr, W.W. (1988). A hierarchy theorem for pram-based complexity classes. In: Nori, K.V., Kumar, S. (eds) Foundations of Software Technology and Theoretical Computer Science. FSTTCS 1988. Lecture Notes in Computer Science, vol 338. Springer, Berlin, Heidelberg. https://doi.org/10.1007/3-540-50517-2_84

Download citation

  • DOI: https://doi.org/10.1007/3-540-50517-2_84

  • Published:

  • Publisher Name: Springer, Berlin, Heidelberg

  • Print ISBN: 978-3-540-50517-4

  • Online ISBN: 978-3-540-46030-5

  • eBook Packages: Springer Book Archive

Publish with us

Policies and ethics

Search

Navigation