Strong closure operators on the set of partial Boolean functions

被引：0
作者：
S. S. Marchenkov
机构：
[1] Moscow State University,Faculty of Computational Mathematics and Cybernetics
来源：
Doklady Mathematics | 2008年 / 77卷
关键词：
Boolean Function; Composition Operator; DOKLADY Mathematic; Closure Operator; Logical Formula;
D O I：
暂无
中图分类号：
学科分类号：
摘要：
引用
收藏
页码：288 / 289
页数：1
相关论文
共 50 条
[41]   On the Multiplicative Complexity of Boolean Functions [J].
Selezneva, Svetlana N. .
FUNDAMENTA INFORMATICAE, 2016, 145 (03) :399-404
[42]   On the Symmetric Negabent Boolean Functions [J].
Sarkar, Sumanta .
PROGRESS IN CRYPTOLOGY - INDOCRYPT 2009, PROCEEDINGS, 2009, 5922 :136-143
[43]   ON THE POWER OF CHOICE FOR BOOLEAN FUNCTIONS [J].
Fraiman, Nicolas ;
Lichev, Lyuben ;
Mitsche, Dieter .
SIAM JOURNAL ON DISCRETE MATHEMATICS, 2022, 36 (03) :1943-1954
[44]   Hacking of the AES with Boolean Functions [J].
Dubois, Michel ;
Filiol, Eric .
ICISSP: PROCEEDINGS OF THE 3RD INTERNATIONAL CONFERENCE ON INFORMATION SYSTEMS SECURITY AND PRIVACY, 2017, :599-609
[45]   Topological aspects of Boolean functions [J].
Bjorner, Anders ;
Goresky, Mark ;
Macpherson, Robert .
PURE AND APPLIED MATHEMATICS QUARTERLY, 2024, 20 (03) :1029-1063
[46]   Recognition of interval Boolean functions [J].
Cepek, Ondrej ;
Kronus, David ;
Kucera, Petr .
ANNALS OF MATHEMATICS AND ARTIFICIAL INTELLIGENCE, 2008, 52 (01) :1-24
[47]   Asymptotic nonlinearity of Boolean functions [J].
Rodier, Francois .
DESIGNS CODES AND CRYPTOGRAPHY, 2006, 40 (01) :59-70
[48]   Computational complexity of Boolean functions [J].
Korshunov, A. D. .
RUSSIAN MATHEMATICAL SURVEYS, 2012, 67 (01) :93-165
[49]   Asymptotically optimal Boolean functions [J].
Schmidt, Kai-Uwe .
JOURNAL OF COMBINATORIAL THEORY SERIES A, 2019, 164 :50-59
[50]   On a class of bases for boolean functions [J].
Skordev D. .
Journal of Mathematical Sciences, 2009, 158 (5) :753-758
12345