Maximal faces of Boolean functions with a small number of zeroes

被引：1

作者：

Romanov M.Y. ^{[1
]}

机构：

[1] Dorodnicyn Computing Centre, Russian Academy of Sciences, Moscow 119333

来源：

Pattern Recognition and Image Analysis | 2010年 / 20卷 / 04期

基金：

俄罗斯基础研究基金会;

关键词：

Boolean functions with a small number of zeroes; minimization of disjunctive normal form; problems on optimization;

D O I：

10.1134/S1054661810040073

中图分类号：

学科分类号：

摘要：

It is shown that there are no kernel faces in a contracted disjunctive normal form of a complete Boolean function (in seven or more variables) with a small number of zeroes. In addition, a lower bound for the number of faces that go through the same point is found. © 2010 Pleiades Publishing, Ltd.

引用

页码：474 / 478

页数：4

共 50 条

[1] Maximal number of Boolean functions realized by an initial Boolean automaton with two constant states
Sysoeva, L. N.
MOSCOW UNIVERSITY MATHEMATICS BULLETIN, 2016, 71 (04) : 140 - 145
[2] Maximal Nonlinearity in Balanced Boolean Functions with Even Number of Inputs, Revisited
Picek, Stjepan
Santana, Roberto
Jakobovic, Domagoj
2016 IEEE CONGRESS ON EVOLUTIONARY COMPUTATION (CEC), 2016, : 3222 - 3229
[3] Asymptotics for the Complexity of Boolean Functions with Small Number of Ones
N. P. Red’kin
Mathematical Notes, 2021, 109 : 256 - 261
[4] Asymptotics for the Complexity of Boolean Functions with Small Number of Ones
Red'kin, N. P.
MATHEMATICAL NOTES, 2021, 109 (1-2) : 256 - 261
[5] Implementation complexity of Boolean functions with a small number of ones
Redkin, Nikolay P.
DISCRETE MATHEMATICS AND APPLICATIONS, 2021, 31 (04): : 271 - 279
[6] DISJUNCTIVE NORMAL FORMS OF BOOLEAN FUNCTIONS WITH A SMALL NUMBER OF ZEROS
KOGAN, AY
USSR COMPUTATIONAL MATHEMATICS AND MATHEMATICAL PHYSICS, 1987, 27 (5-6): : 185 - 190
[7] Comparative analysis of the complexity of boolean functions with a small number of zeros
Maximov, Yu. V.
DOKLADY MATHEMATICS, 2012, 86 (03) : 854 - 856
[8] Comparative analysis of the complexity of boolean functions with a small number of zeros
Yu. V. Maximov
Doklady Mathematics, 2012, 86 : 854 - 856
[9] BOOLEAN FUNCTIONS WITH A LARGE NUMBER OF SUBFUNCTIONS AND SMALL COMPLEXITY AND DEPTH
UHLIG, D
LECTURE NOTES IN COMPUTER SCIENCE, 1991, 529 : 395 - 404
[10] On maximal QROBDD's of Boolean functions
Michon, JF
Yunès, JB
Valarcher, P
RAIRO-THEORETICAL INFORMATICS AND APPLICATIONS, 2005, 39 (04): : 677 - 686

← 1 2 3 4 5 →