Machine Complexity Versus Interconnection Complexity in Iterative Arrays
From MaRDI portal
Publication:5625086
DOI10.1109/T-C.1971.223238zbMath0219.94031MaRDI QIDQ5625086
Publication date: 1971
Published in: IEEE Transactions on Computers (Search for Journal in Brave)
Analysis of algorithms and problem complexity (68Q25) Cellular automata (computational aspects) (68Q80)
Related Items (4)
Two-dimensional cellular automata and their neighborhoods ⋮ PROCESSES AND THEIR INTERACTIONS ⋮ Survey of research in the theory of homogeneous structures and their applications ⋮ Iterative arrays with direct central control
This page was built for publication: Machine Complexity Versus Interconnection Complexity in Iterative Arrays
