THE METHOD OF CONSTRUCTING A BOOLEAN FORMULA OF A POLYGON IN THE DISJUNCTIVE NORMAL FORM
The paper focuses on finalizing the method of finding a polygon Boolean formula in disjunctive normal form, described in the previous article [1]. An improved method eliminates the drawback asso-ciated with the existence of a class of problems for which the solution is only approximate. The pro-pose...
Main Author: | A. A. Butov |
---|---|
Format: | Article |
Language: | Russian |
Published: |
The United Institute of Informatics Problems of the National Academy of Sciences of Belarus
2016-10-01
|
Series: | Informatika |
Online Access: | https://inf.grid.by/jour/article/view/168 |
Similar Items
-
Minimization of Boolean functions in the class of orthogonal disjunctive normal forms
by: Yu. V. Pottosin
Published: (2021-07-01) -
The shortest disjunctive normal forms of Boolean functions by reducing the number of arguments
by: Yung, Ho Sen
Published: (2009) -
The shortest disjunctive normal forms of Boolean functions by reducing the number of arguments
by: Yung, Ho Sen
Published: (2009) -
Filters on disjunctive boolean networks
by: Plana Perillán, Francisco Antonio
Published: (2015) -
An Extension of Proof Graphs for Disjunctive Parameterised Boolean Equation Systems
by: Yutaro Nagae, et al.
Published: (2017-01-01)