The complexity of reconfiguring network models

Y. Benasher; K. J. Lange; D. Peleg; A. Schuster

doi:10.1006/inco.1995.1122

The complexity of reconfiguring network models

Y. Benasher, K. J. Lange, D. Peleg, A. Schuster

Department of Computer Science

Research output: Contribution to journal › Article › peer-review

Abstract

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.

Original language	English
Pages (from-to)	41-58
Number of pages	18
Journal	Information and Computation
Volume	121
Issue number	1
DOIs	https://doi.org/10.1006/inco.1995.1122
State	Published - 15 Aug 1995

ASJC Scopus subject areas

Theoretical Computer Science
Information Systems
Computer Science Applications
Computational Theory and Mathematics

Access to Document

10.1006/inco.1995.1122

Cite this

@article{f9fcfca37b704a6587d5ba8ce6fccb4b,

title = "The complexity of reconfiguring network models",

abstract = "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.",

author = "Y. Benasher and Lange, {K. J.} and D. Peleg and A. Schuster",

year = "1995",

month = aug,

day = "15",

doi = "10.1006/inco.1995.1122",

language = "English",

volume = "121",

pages = "41--58",

journal = "Information and Computation",

issn = "0890-5401",

publisher = "Elsevier",

number = "1",

}

TY - JOUR

T1 - The complexity of reconfiguring network models

AU - Benasher, Y.

AU - Lange, K. J.

AU - Peleg, D.

AU - Schuster, A.

PY - 1995/8/15

Y1 - 1995/8/15

N2 - 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.

AB - 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.

UR - http://www.scopus.com/inward/record.url?scp=0002439992&partnerID=8YFLogxK

U2 - 10.1006/inco.1995.1122

DO - 10.1006/inco.1995.1122

M3 - Article

AN - SCOPUS:0002439992

SN - 0890-5401

VL - 121

SP - 41

EP - 58

JO - Information and Computation

JF - Information and Computation

IS - 1

ER -

The complexity of reconfiguring network models

Abstract

ASJC Scopus subject areas

Access to Document

Other files and links

Fingerprint

Cite this