Enviar artigo por via de e-mail High-Accuracy Bounds of the Shannon Function for Formula Complexity in Bases with Direct and Iterative Variables
- Autores: Konovodov V.A.1, Lozhkin S.A.2
-
Afiliações:
- Yandeks Technology
- Faculty of Computational Mathematics and Cybernetics, Moscow State University
- Edição: Volume 30, Nº 1 (2019)
- Páginas: 26-35
- Seção: Article
- URL: https://journals.rcsi.science/1046-283X/article/view/247822
- DOI: https://doi.org/10.1007/s10598-019-09431-4
- ID: 247822
Citar
Acesso aberto
Acesso está concedido
Somente assinantes
Resumo
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.
Palavras-chave
Sobre autores
V. Konovodov
Yandeks Technology
Autor responsável pela correspondência
Email: vkonovodov@gmail.com
Rússia, Moscow
S. Lozhkin
Faculty of Computational Mathematics and Cybernetics, Moscow State University
Email: vkonovodov@gmail.com
Rússia, Moscow
Arquivos suplementares
