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
关键词
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 条