This article is cited in 5 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.

UDC: 519.95

Received: 24.12.2012
Revised: 23.04.2013

Bibliographic databases:

•