|
This article is cited in 4 scientific papers (total in 4 papers)
Sufficient conditions for the minimal $\pi$-schemes for linear Boolean functions to be locally non-repeating
K. L. Rychkov Sobolev Institute of Mathematics, 4 Koptyug Ave., 630090 Novosibirsk, Russia
Abstract:
We formulate sufficient conditions for the minimal $\pi$-schemes for linear Boolean functions to be locally non-repeating. The validity of these conditions gives a description of the classes of all minimal $\pi$-schemes for linear Boolean functions which depend essentially on n variables. Ill. 2, bibliogr. 12.
Keywords:
formula size, $\pi$-scheme, lower bound on the complexity.
Received: 16.03.2015 Revised: 23.07.2015
Citation:
K. L. Rychkov, “Sufficient conditions for the minimal $\pi$-schemes for linear Boolean functions to be locally non-repeating”, Diskretn. Anal. Issled. Oper., 22:5 (2015), 71–85; J. Appl. Industr. Math., 9:4 (2015), 580–587
Linking options:
https://www.mathnet.ru/eng/da829 https://www.mathnet.ru/eng/da/v22/i5/p71
|
Statistics & downloads: |
Abstract page: | 159 | Full-text PDF : | 65 | References: | 27 | First page: | 6 |
|