Abstract
A formula is derived for quick expert estimates of the maximum complexity of multipole networks as a function of the number of external inputs and outputs assuming ordered and unordered connections.
This is a preview of subscription content, log in via an institution to check access.
Similar content being viewed by others
Literature Cited
Kh. L. Salum, "Estimating the structural complexity of systems," Kibernetika, No. 4, 8–12 (1988).
G. M. Fikhtengol'ts, A Course in Differential and Integral Calculus [in Russian], Nauka, Moscow (1969).
I. S. Gradshtein and I. M. Ryzhik, Tables of Integrals, Sums, Series, and Products [in Russian], Fizmatgiz, Moscow (1962).
V. I. Skurikhin, V. B. Shifrin, and V. V. Dubrovskii, Mathematical Modeling [in Russian], Tekhnika, Kiev (1983).
L. A. Rastrigin, Modern Principles of Control for Complex Systems [in Russian], Sovetskoe Radio, Moscow (1980).
Kh. L. Salum, "Using complexity macroestimates in control design," Élektricheskie Stantsii, No. 9, 43–45 (1986).
Additional information
Translated from Kibernetika i Sistemnyi Analiz, No. 4, pp. 47–53, July–August, 1991.
Rights and permissions
About this article
Cite this article
Ol'man, V.N., Salum, K.L. Bound on maximum structural complexity of systems. Cybern Syst Anal 27, 513–519 (1991). https://doi.org/10.1007/BF01130360
Received:
Issue Date:
DOI: https://doi.org/10.1007/BF01130360