当前位置:
X-MOL 学术
›
Moscow Univ. Math. Bull.
›
论文详情
Our official English website, www.x-mol.net, welcomes your feedback! (Note: you will need to create a separate account there.)
Multilevel Representation and Complexity of Circuits of Unbounded Fan-In Gates
Moscow University Mathematics Bulletin Pub Date : 2021-03-10 , DOI: 10.3103/s0027132220030055 I. S. Sergeev
中文翻译:
无限制扇入门的电路的多级表示和复杂性
更新日期:2021-03-11
Moscow University Mathematics Bulletin Pub Date : 2021-03-10 , DOI: 10.3103/s0027132220030055 I. S. Sergeev
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.
中文翻译:
无限制扇入门的电路的多级表示和复杂性
摘要
在多输入广义连接的基础上,获得了电路复杂性的香农函数的渐近\(C(n)\ sim \ sqrt {2} \ cdot 2 ^ {n / 2} \)的新的更简单证明。