No CrossRef data available.
Article contents
The Communication Hierarchy of Time and SpaceBounded Parallel Machines
Published online by Cambridge University Press: 15 November 2003
Abstract
We describe the communicating alternating machines and their simulation. We show that, in the case of communicating alternating machines which are bounded, simultaneously, by polynomial time and logarithmic space, the use of three communication levels instead of two does not increase computational power of communicating alternating machines. This resolves an open problem [2] concerning the exact position of machines with three communication levels in the hierarchy.
- Type
- Research Article
- Information
- Copyright
- © EDP Sciences, 2003
References
Geffert, V., A communication hierarchy of parallel computations, Elsevier Science.
Theoret. Comput. Sci.
198 (1998) 99-130.
CrossRef
Hromkovic, J., Karhumäki, J., Rovan, B. and Slobodová, A., On the power of synchronization in parallel computations.
Discrete Appl. Math.
32 (1991) 155-82.
CrossRef
Slobodová, A., Some properties of space-bounded synchronized alternating Turing machines with universal states only.
Theoret. Comput. Sci.
96 (1992) 411-19.
CrossRef
P. van Emde Boas, Machine models and simulations, in Handbook of Theoretical Computer Science, edited by J. van Leeuwen. Elsevier Science (1989).
J. Wiedermann, On the power of synchronization. (EIK)
25 (1989) 499-506.