摘要:
springer.com
sci-hub.st 参考文章(9)
P. Rosenstiehl, J.R. Fiksel, A. Holliger, INTELLIGENT GRAPHS: NETWORKS OF FINITE AUTOMATA CAPABLE OF SOLVING GRAPH PROBLEMS Graph Theory and Computing. pp. 219- 265 ,(1972) , 10.1016/B978-1-4832-3187-7.50019-2
Charles E Leiserson, H T Kung, Systolic Arrays for (VLSI). ,(1978)
Maurice Tchuente, Computation on binary tree-networks Discrete Applied Mathematics. ,vol. 14, pp. 295- 310 ,(1986) , 10.1016/0166-218X(86)90033-8
Maurice Tchuente, Computation of Boolean functions on networks of binary automata Journal of Computer and System Sciences. ,vol. 26, pp. 269- 277 ,(1983) , 10.1016/0022-0000(83)90016-8
Maurice Tchuente, Parallel calculation of a linear mapping on a computer network Linear Algebra and its Applications. ,vol. 28, pp. 223- 247 ,(1979) , 10.1016/0024-3795(79)90136-8
Michael R. Garey, David S. Johnson, Computers and Intractability: A Guide to the Theory of NP-Completeness ,(1979)
K.H. Kim, F.W. Roush, Generating all linear transformations Linear Algebra and its Applications. ,vol. 37, pp. 97- 101 ,(1981) , 10.1016/0024-3795(81)90170-1
Maurice Tchuente, Permutation Factorization on Star-Connected Networks of Binary Automata Siam Journal on Algebraic and Discrete Methods. ,vol. 6, pp. 537- 540 ,(1985) , 10.1137/0606052
Maurice Tchuente, Parallel realization of permutations over trees Discrete Mathematics. ,vol. 39, pp. 211- 214 ,(1982) , 10.1016/0012-365X(82)90143-1