|
|
Vestnik Moskovskogo Universiteta. Seriya 1. Matematika. Mekhanika, 2020, Number 3, Pages 42–46
(Mi vmumm4327)
|
|
|
|
Short notes
Multilevel representation and complexity of circuits of unbounded fan-in gates
I. S. Sergeev Research Institute "Kvant", Moscow
Abstract:
A new simpler proof of the asymptotic $C(n)\sim\sqrt2\cdot2^{n/2}$ of the Shannon function of the circuit complexity over the basis of multi-input generalized conjunctions is obtained.
Key words:
Boolean functions, Boolean circuits, complexity, multilevel representation.
Received: 28.02.2018
Citation:
I. S. Sergeev, “Multilevel representation and complexity of circuits of unbounded fan-in gates”, Vestnik Moskov. Univ. Ser. 1. Mat. Mekh., 2020, no. 3, 42–46; Moscow University Mathematics Bulletin, 75:3 (2020), 121–125
Linking options:
https://www.mathnet.ru/eng/vmumm4327 https://www.mathnet.ru/eng/vmumm/y2020/i3/p42
|
|