|
|
International workshop "Syntax and semantics of logical systems"
August 13, 2019 11:10–10:50, Ñamp site on the shore of Lake Hovsgol
|
 |
|
 |
|
|
|
Representation of polynomially stable functions by sums of Boolean read-once functions over the elementary basis
O. V. Zubkov
Irkutsk State University
|
| Number of views: |
| This page: | 62 | | Materials: | 2 |
|
Abstract:
The paper considers polynomially stable Boolean functions.
Proved that Boolean read-once functions over the
elementary basis of a certain kind are polynomially stable. The following is an algorithm for obtaining for any polynomial stable function its representation as a sum of such
Boolean read-once functions.
Supplementary materials:
Çóáêîâ.pdf (1.3 Mb)
|
|
Contact us: