| Issue |
RAIRO-Theor. Inf. Appl.
Volume 37, Number 2, April/June 2003
|
|
|---|---|---|
| Page(s) | 159 - 176 | |
| DOI | https://doi.org/10.1051/ita:2003012 | |
| Published online | 15 November 2003 | |
The Communication Hierarchy of Time and Space Bounded Parallel Machines
Department of Computer Science, P. J. Šafárik University,
Jesenná 5, 04154 Košice, Slovakia; popely@mail.com.
Received:
June
2001
Accepted:
August
2003
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.
Mathematics Subject Classification: 03D15
Key words: Computational complexity / synchronized alternation.
© EDP Sciences, 2003
Current usage metrics show cumulative count of Article Views (full-text article views including HTML views, PDF and ePub downloads, according to the available data) and Abstracts Views on Vision4Press platform.
Data correspond to usage on the plateform after 2015. The current usage metrics is available 48-96 hours after online publication and is updated daily on week days.
Initial download of the metrics may take a while.