Complexity of the Realization of a Linear Boolean Function in the Class of π-Schemes
- Авторлар: Rychkov K.1
-
Мекемелер:
- Sobolev Institute of Mathematics
- Шығарылым: Том 12, № 3 (2018)
- Беттер: 540-576
- Бөлім: Article
- URL: https://journals.rcsi.science/1990-4789/article/view/213100
- DOI: https://doi.org/10.1134/S1990478918030146
- ID: 213100
Дәйексөз келтіру
Аннотация
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.
Негізгі сөздер
Авторлар туралы
K. Rychkov
Sobolev Institute of Mathematics
Хат алмасуға жауапты Автор.
Email: rychkov@math.nsc.ru
Ресей, pr. Akad. Koptyuga 4, Novosibirsk, 630090