Implementation of Boolean Functions with a Bounded Number of Zeros by Disjunctive Normal Forms

被引：2

作者：

Maximov, Yu. V. ^{[1
,2
]}

机构：

[1] Moscow Inst Phys & Technol, Dolgoprudnyi 141700, Moscow Oblast, Russia

[2] Natl Res Univ, Higher Sch Econ, Moscow 109028, Russia

来源：

COMPUTATIONAL MATHEMATICS AND MATHEMATICAL PHYSICS | 2013年 / 53卷 / 09期

关键词：

Boolean function; disjunctive normal form; complexity of Boolean function; probably approximately correct learning; algebraic classification methods; EQUIVALENT;

D O I：

10.1134/S096554251309008X

中图分类号：

O29 [应用数学];

学科分类号：

070104 ;

摘要：

The problem of constructing simple disjunctive normal forms (DNFs) of Boolean functions with a small number of zeros is considered. The problem is of interest in the complexity analysis of Boolean functions and in its applications to data analysis. The method used is a further development of the reduction approach to the construction of DNFs of Boolean functions. A key idea of the reduction method is that a Boolean function is represented as a disjunction of Boolean functions with fewer zeros. In a number of practically important cases, this technique makes it possible to considerably reduce the complexity of DNF implementations of Boolean functions.

引用

页码：1391 / 1409

页数：19

共 50 条

[31] Binary functions of multivalued arguments: generalization and investigation of disjunctive normal forms for such functions
Panov, A. V.
[J]. COMPUTATIONAL MATHEMATICS AND MATHEMATICAL PHYSICS, 2015, 55 (01) : 131 - 139
[32] ON THE COMPARISON OF THE BOOLEAN FUNCTIONS WITH RESPECT TO NORMAL AND ARBITRARY FORMS
POVAROV, GN
[J]. SOVIET JOURNAL OF COMPUTER AND SYSTEMS SCIENCES, 1985, 23 (04): : 123 - 125
[33] Composition of post classes and normal forms of Boolean functions
Couceiro, Miguel
Foldes, Stephan
Lehtonen, Erkko
[J]. DISCRETE MATHEMATICS, 2006, 306 (24) : 3223 - 3243
[34] Implementation complexity of Boolean functions with a small number of ones
Redkin, Nikolay P.
[J]. DISCRETE MATHEMATICS AND APPLICATIONS, 2021, 31 (04): : 271 - 279
[35] On the testability of implementations of Boolean functions based on full normal forms
Kiev Polytechnical Inst, Kiev, Ukraine
[J]. Eng Simul, 5-6 (799-805):
[36] An upper bound for complexity of polynomial normal forms of Boolean functions
Kirichenko, K. D.
[J]. DISCRETE MATHEMATICS AND APPLICATIONS, 2005, 15 (04): : 351 - 360
[37] ON THE MINIMIZATION OF k-VALUED LOGIC FUNCTIONS IN THE CLASS OF DISJUNCTIVE NORMAL FORMS
Kabulov, A.
Baizhumanov, A.
Berdimurodov, M.
[J]. JOURNAL OF MATHEMATICS MECHANICS AND COMPUTER SCIENCE, 2024, 121 (01): : 37 - 45
[38] ON THE NUMBER OF SYMMETRY TYPES OF BOOLEAN FUNCTIONS OF NORMAL-VARIABLES
SLEPIAN, D
[J]. CANADIAN JOURNAL OF MATHEMATICS-JOURNAL CANADIEN DE MATHEMATIQUES, 1953, 5 (02): : 185 - 193
[39] SIMPLIFICATION ALGORITHMS FOR DISJUNCTIVE NORMAL FORMS
ZHURAVLEV, II
[J]. DOKLADY AKADEMII NAUK SSSR, 1960, 132 (02): : 260 - 263
[40] THE PROBLEM OF MINIMIZATION OF DISJUNCTIVE NORMAL FORMS
ANDREEV, AE
[J]. DOKLADY AKADEMII NAUK SSSR, 1984, 274 (02): : 265 - 269

← 1 2 3 4 5 →