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

共 3 条

[1]

Zhuravlev Y.I., Kogan A.Y., Implementation of Boolean Functions with Small Number of Zeros by Disjunctive Normal Forms and Related Problems, Dokl. Akad. Nauk USSR, 285, 4, pp. 795-799, (1985)

[2]

Zhuravlev Y.I., Kogan A.Y., Algorithm for Generating the Disjunctive Normal Form Equivalent to the Product of Left Parts of Nelson Type Equations, Zh. Vychisl. Mat. Mat. Fiz., 26, 8, pp. 1243-1249, (1986)

[3]

Kogan A.Y., On Disjunctive Normal Forms of Boolean Functions with Small Number of Zeros, Zh. Vychisl. Mat. Mat. Fiz., 27, 6, pp. 924-931, (1987)

← 1 →