|
This article is cited in 4 scientific papers (total in 4 papers)
Implementation of Boolean functions with a bounded number of zeros by disjunctive normal forms
Yu. V. Maximovab a Moscow Institute of Physics and Technology, Institutskii per. 9, Dolgoprudnyi, Moscow oblast, 141700, Russia
b National Research University “Higher School of Economics”, Pokrovskii bulv. 11, Moscow, 109028, Russia
Abstract:
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.
Key words:
Boolean function, disjunctive normal form, complexity of Boolean function, probably approximately correct learning, algebraic classification methods.
Received: 16.02.2012 Revised: 31.03.2013
Citation:
Yu. V. Maximov, “Implementation of Boolean functions with a bounded number of zeros by disjunctive normal forms”, Zh. Vychisl. Mat. Mat. Fiz., 53:9 (2013), 1569–1588; Comput. Math. Math. Phys., 53:9 (2013), 1391–1409
Linking options:
https://www.mathnet.ru/eng/zvmmf9922 https://www.mathnet.ru/eng/zvmmf/v53/i9/p1569
|
Statistics & downloads: |
Abstract page: | 302 | Full-text PDF : | 120 | References: | 56 | First page: | 10 |
|