High-Accuracy Bounds of the Shannon Function for Formula Complexity in Bases with Direct and Iterative Variables

被引：0
|
作者：
Konovodov V.A. [1 ]
Lozhkin S.A. [2 ]
机构：
[1] Yandeks Technology, Moscow
[2] Faculty of Computational Mathematics and Cybernetics, Moscow State University, Moscow
来源：
Computational Mathematics and Modeling | 2019年 / 30卷 / 1期
基金：
俄罗斯基础研究基金会;
关键词：
Boolean functions; formula; iterative variable; Shannon function;
D O I：
10.1007/s10598-019-09431-4
中图分类号：
学科分类号：
摘要：
We consider the realization of Boolean functions by formulas with restrictions on superpositions of basis functions such that superposition is allowed only by iterative variables. For a number of special symmetrical bases, we establish new high-accuracy bounds of the Shannon function L(n) for the complexity of realization of Boolean functions dependent on n direct variables. © 2019, Springer Science+Business Media, LLC, part of Springer Nature.
引用
收藏
页码：26 / 35
页数：9
相关论文
共 50 条
12345