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...
Saved in:
| Main Author: | A. A. Butov |
|---|---|
| Format: | Article |
| Language: | Russian |
| Published: |
National Academy of Sciences of Belarus, the United Institute of Informatics Problems
2016-10-01
|
| Series: | Informatika |
| Online Access: | https://inf.grid.by/jour/article/view/168 |
| Tags: |
Add Tag
No Tags, Be the first to tag this record!
|
Similar Items
-
Minimization of Boolean functions in the class of orthogonal disjunctive normal forms
by: Yu. V. Pottosin
Published: (2021-07-01) -
Experimental comparison of the effectiveness of programs for minimizing systems of Boolean functions in the class of disjunctive normal forms
by: P. N. Bibilo, et al.
Published: (2022-06-01) -
Technology independent optimization when implementing sparse systems of disjunctive normal forms of Boolean functions in ASIC
by: P. N. Bibilo, et al.
Published: (2024-03-01) -
Disjunctive and conjunctive decompositions of incompletely defined Boolean functions in a Binary Decision Diagram
by: P. N. Bibilo
Published: (2025-03-01) -
Set-theoretic operation of polygons unification on a plane 1
by: A. A. Butov
Published: (2019-03-01)