|
Vestnik Moskovskogo Universiteta. Seriya 1. Matematika. Mekhanika, 2013, Number 2, Pages 49–53
(Mi vmumm395)
|
|
|
|
This article is cited in 3 scientific papers (total in 3 papers)
Short notes
Complexity of realization of a linear Boolean function in Sheffer's basis
Yu. A. Kombarov Lomonosov Moscow State University, Faculty of Mechanics and Mathematics
Abstract:
The paper is focused on realization of linear Boolean functions by circuits of functional elements in the basis $\left\{\overline{x \& y}\right\}$. The exact value of complexity of negation of linear function is obtained in this paper. Another result is the description of all minimal circuts realizing a linear function.
Key words:
circuit of functional elements, linear Boolean function, minimal circuit, standard block.
Received: 25.04.2012
Citation:
Yu. A. Kombarov, “Complexity of realization of a linear Boolean function in Sheffer's basis”, Vestnik Moskov. Univ. Ser. 1. Mat. Mekh., 2013, no. 2, 49–53; Moscow University Mathematics Bulletin, 68:2 (2013), 114–117
Linking options:
https://www.mathnet.ru/eng/vmumm395 https://www.mathnet.ru/eng/vmumm/y2013/i2/p49
|
Statistics & downloads: |
Abstract page: | 141 | Full-text PDF : | 31 | References: | 28 |
|