| Autor: |
Rychkov, K. L. |
| Zdroj: |
Journal of Applied & Industrial Mathematics; Jul2018, Vol. 12 Issue 3, p540-576, 37p |
| Abstrakt: |
Using Khrapchenko’s method, we obtain the exact lower bound of 40 for the complexity in the class of π-schemes of a linear Boolean function depending substantially on 6 variables. We give a simplified proof of several lower bounds for the complexity of linear Boolean functions which are previously obtained on the basis of the same method. [ABSTRACT FROM AUTHOR] |
| Databáze: |
Complementary Index |
| Externí odkaz: |
|
Full text from SpringerLink