|
Diskretnyi Analiz i Issledovanie Operatsii, 2013, Volume 20, Issue 4, Pages 65–87
(Mi da740)
|
|
|
|
This article is cited in 4 scientific papers (total in 4 papers)
On minimal circuts in Sheffer basis for linear Boolean functions
Yu. A. Kombarov M. V. Lomonosov Moscow State University, Lenin Gory,
119991 Moscow, Russia
Abstract:
Realizations of pairity function and its negation by Boolean circuits in Sheffer basis are considered. The exact value of complexity of pairity function's negation is established. Another result is structure description of minimal circuits for the parity function. Ill. 13, bibliogr. 8.
Keywords:
Boolean circuit, pairity function, Sheffer stroke.
Received: 24.12.2012 Revised: 23.04.2013
Citation:
Yu. A. Kombarov, “On minimal circuts in Sheffer basis for linear Boolean functions”, Diskretn. Anal. Issled. Oper., 20:4 (2013), 65–87
Linking options:
https://www.mathnet.ru/eng/da740 https://www.mathnet.ru/eng/da/v20/i4/p65
|
Statistics & downloads: |
Abstract page: | 491 | Full-text PDF : | 120 | References: | 64 | First page: | 7 |
|