The communication hierarchy of time and space bounded parallel machines
RAIRO - Theoretical Informatics and Applications - Informatique Théorique et Applications (2003)
- Volume: 37, Issue: 2, page 159-176
- ISSN: 0988-3754
Access Full Article
top
Abstract
topHow to cite
topPopély, Norbert. "The communication hierarchy of time and space bounded parallel machines." RAIRO - Theoretical Informatics and Applications - Informatique Théorique et Applications 37.2 (2003): 159-176. <http://eudml.org/doc/245571>.
@article{Popély2003,
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.},
author = {Popély, Norbert},
journal = {RAIRO - Theoretical Informatics and Applications - Informatique Théorique et Applications},
keywords = {computational complexity; synchronized alternation; communicating alternating machines; synchronized alternating machines},
language = {eng},
number = {2},
pages = {159-176},
publisher = {EDP-Sciences},
title = {The communication hierarchy of time and space bounded parallel machines},
url = {http://eudml.org/doc/245571},
volume = {37},
year = {2003},
}
TY - JOUR
AU - Popély, Norbert
TI - The communication hierarchy of time and space bounded parallel machines
JO - RAIRO - Theoretical Informatics and Applications - Informatique Théorique et Applications
PY - 2003
PB - EDP-Sciences
VL - 37
IS - 2
SP - 159
EP - 176
AB - 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.
LA - eng
KW - computational complexity; synchronized alternation; communicating alternating machines; synchronized alternating machines
UR - http://eudml.org/doc/245571
ER -
References
top- [1] A.K. Chandra, D.C. Kozen and L.J. Stockmeyer, Alternation. J. ACM 28 (1981) 114–33. Zbl0473.68043
- [2] V. Geffert, A communication hierarchy of parallel computations, Elsevier Science. Theoret. Comput. Sci. 198 (1998) 99–130. Zbl0902.68074
- [3] J. Hromkovič, J. Karhumäki, B. Rovan and A. Slobodová, On the power of synchronization in parallel computations. Discrete Appl. Math. 32 (1991) 155–82. Zbl0734.68036
- [4] A. Slobodová, Communication for alternating machines. Acta Inform. 29 (1992) 425–41. Zbl0769.68022
- [5] A. Slobodová, Some properties of space-bounded synchronized alternating Turing machines with universal states only. Theoret. Comput. Sci. 96 (1992) 411–19. Zbl0754.68047
- [6] P. van Emde Boas, Machine models and simulations, in Handbook of Theoretical Computer Science, edited by J. van Leeuwen. Elsevier Science (1989). Zbl0900.68265MR1127167
- [7] J. Wiedermann, On the power of synchronization. J. Inf. Process. Cybern. (EIK) 25 (1989) 499–506. Zbl0689.68074
NotesEmbed ?
topYou must be logged in to post comments.
To embed these notes on your page include the following JavaScript code on your page where you want the notes to appear.