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).
Keywords
These keywords were added by machine and not by the authors. This process is experimental and the keywords may be updated as the learning algorithm improves.
Preview
Unable to display preview. Download preview PDF.
References
Batcher, K., Sorting Networks and Their Applications, 1968 Spring Joint Computer Conference, AFIPS Proceedings, Vol. 32, 1968, pp. 307–314.
Hopcroft, J. and Ullman, J., Introduction to Automata Theory, Languages, and Computation, Addison-Wesley, Reading, Massachusetts, 1979.
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.
Pippenger, N., On Simultaneous Resource Bounds (Preliminary Version), 20th Proceedings of IEEE Symposium on the Foundations of Computer Science, 1979, pp. 307–311.
Pippenger, N. and Fischer, M., Relations Among Comlexity Measures, Journal of the ACM, Vol. 26, No. 2, April, 1979, pp. 361–381.
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.
Stone, H., Parallel Processing with the Perfect Shuffle, IEEE Transactions on Computers, Vol. c-20, No. 2, February, 1971, pp. 153–161.
Author information
Authors and Affiliations
Editor information
Rights 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