Abstract
A new simpler proof of the asymptotic \(C(n)\sim\sqrt{2}\cdot 2^{n/2}\) of the Shannon function of the circuit complexity over the basis of multi-input generalized conjunctions is obtained.
This is a preview of subscription content, log in via an institution to check access.
Similar content being viewed by others
REFERENCES
O. B. Lupanov, Asymptotic Estimates of Complexity of Control Systems (Moscow State Univ., Moscow, 1984).
A. A. Markov, ‘‘On the inversion complexity of function systems,’’ Dokl. Akad. Nauk SSSR 116, 917–919 (1957).
E. I. Nechiporuk, ‘‘Complexity of schemes in certain bases containing nontrivial elements with zero weights,’’ Sov. Math., Dokl. 2, 1087–1088 (1961).
I. S. Sergeev, ‘‘On the complexity of bounded-depth circuits and formulas over the basis of fan-in gates,’’ Discrete Math. Appl. 29, 241–254 (2019). doi https://doi.org/10.1515/dma-2019-0022
F. Kárteszi, Introduction to Finite Geometries (North Holland, 1976). doi 10.1016/C2013-0-11919-8
Funding
This work was supported by the Russian Foundation for Basic Research, project no. 19–01–00294a.
Author information
Authors and Affiliations
Corresponding author
Additional information
Translated by I. Obrezanova
About this article
Cite this article
Sergeev, I.S. Multilevel Representation and Complexity of Circuits of Unbounded Fan-In Gates. Moscow Univ. Math. Bull. 75, 121–125 (2020). https://doi.org/10.3103/S0027132220030055
Received:
Revised:
Accepted:
Published:
Issue Date:
DOI: https://doi.org/10.3103/S0027132220030055