On the structure, complexity, and depth of the circuits over the basis {&,˅} realizing step Boolean functions
The step Boolean function is a function of the algebra of logic of n Boolean variables, n = 1, 2, … , reducing to 1 on all of the sets of an n -dimensional unit cube, the ordinal numbers of which are not lower than the given set. In this paper, the problem of synthesis of circuits over the basis {&a...
Saved in:
| Main Authors: | , |
|---|---|
| Format: | Article |
| Language: | English |
| Published: |
Kazan Federal University
2020-09-01
|
| Series: | Учёные записки Казанского университета: Серия Физико-математические науки |
| Subjects: | |
| Online Access: | https://kpfu.ru/uz-eng-phm-2020-3-8.html |
| Tags: |
Add Tag
No Tags, Be the first to tag this record!
|