This paper concerns some of the theoretical complexity aspects of the reconfigurable network model. The computational power of the model is investigated under several variants, depending on the type of switches (or switch operations) assumed by the network nodes. Computational power is evaluated by focusing on the set of problems computable in constant time in each variant. A hierarchy of such problem classes corresponding to different variants is shown to exist and is placed relative to traditional classes of complexity theory.
|Title of host publication||Theory of Computing and Systems - ISTCS 1992, Israel Symposium, Proceedings|
|Editors||Danny Dolev, Zvi Galil, Zvi Galil, Michael Rodeh|
|Number of pages||12|
|State||Published - 1992|
|Event||Israel Symposium on the Theory of Computing and Systems, ISTCS 1992 - Haifa, Israel|
Duration: 27 May 1992 → 28 May 1992
|Name||Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)|
|Conference||Israel Symposium on the Theory of Computing and Systems, ISTCS 1992|
|Period||27/05/92 → 28/05/92|
Bibliographical notePublisher Copyright:
© Springer-Verlag Berlin Heidelberg 1992.
ASJC Scopus subject areas
- Theoretical Computer Science
- Computer Science (all)