|
This article is cited in 4 scientific papers (total in 4 papers)
On the comparison of the complexity of two methods for realizing some linear Boolean transformations
K. A. Zykov
Abstract:
We study the complexity of realization of systems of Boolean functions
by circuits over the basis of elements of addition modulo $2$. The systems
of functions determined by matrices without rectangles are considered.
Received: 25.02.1994
Citation:
K. A. Zykov, “On the comparison of the complexity of two methods for realizing some linear Boolean transformations”, Diskr. Mat., 8:2 (1996), 151–159; Discrete Math. Appl., 6:3 (1996), 277–284
Linking options:
https://www.mathnet.ru/eng/dm527https://doi.org/10.4213/dm527 https://www.mathnet.ru/eng/dm/v8/i2/p151
|
Statistics & downloads: |
Abstract page: | 349 | Full-text PDF : | 193 | First page: | 1 |
|