Complexity Lower Bound for Boolean Functions in the Class of Extended Operator Forms
Starting with the fundamental work of D.E.Muller in 1954, the polynomial representations of Boolean functions are widely investigated in connection with the theory of coding and for the synthesis of circuits of digital devices. The operator approach to polynomial representations, proposed in the wor...
| Main Author: | |
|---|---|
| Format: | Article |
| Language: | English |
| Published: |
Irkutsk State University
2019-12-01
|
| Series: | Известия Иркутского государственного университета: Серия "Математика" |
| Subjects: | |
| Online Access: | http://mathizv.isu.ru/en/article/file?id=1325 |