The complexity of reconfiguring network models

DOI10.1006/INCO.1995.1122zbMath0832.68045OpenAlexW2143141523MaRDI QIDQ1898112

Yosi Ben-Asher, David Peleg, Assaf Schuster, Klaus-Joern Lange

Publication date: 20 February 1996

Published in: Information and Computation (Search for Journal in Brave)

Full work available at URL: https://semanticscholar.org/paper/868c08d81ff008593aa9848062a5c383a999b156

zbMATH Keywords

complexity theory

Mathematics Subject Classification ID

Analysis of algorithms and problem complexity (68Q25) Network design and communication in computer systems (68M10) Complexity classes (hierarchies, relations among complexity classes, etc.) (68Q15)

Related Items (4)

RELATING TWO-DIMENSIONAL RECONFIGURABLE MESHES WITH OPTICALLY PIPELINED BUSES ⋮ Simulating shared memory in real time: On the computation power of reconfigurable architectures ⋮ COLLAPSING THE HIERARCHY OF PARALLEL COMPUTATIONAL MODELS ⋮ EFFICIENT SIMULATION OF AN ACYCLIC DIRECTED RECONFIGURABLE MODEL ON AN UNDIRECTED RECONFIGURABLE MODEL

This page was built for publication: The complexity of reconfiguring network models