| TR#: | CS0705 |
| Class: | CS |
| Title: | THE COMPLEXITY OF RECONFIGURING NETWORK MODELS |
| Authors: | Y.Ben-Asher, D. Peleg and A. Schuster |
| PDF - Revised | CS0705.revised.pdf |
| Abstract: | This paper is concerned with 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. |
| Copyright | The above paper is copyright by the Technion, Author(s), or others. Please contact the author(s) for more information |
Remark: Any link to this technical report should be to this page (http://www.cs.technion.ac.il/users/wwwb/cgi-bin/tr-info.cgi/1991/CS/CS0705), rather than to the URL of the PDF files directly. The latter URLs may change without notice.
To the list of the CS technical reports of 1991
To the main CS technical reports page