This article is cited in 1 paper

Complexity and structure of circuits for parity functions

Yu. A. Kombarov

Lomonosov Moscow State University

Abstract: The paper is devoted to circuits implementing parity functions. A review of results establishing exact values of the complexity of parity functions is given. The structure of optimal circuits implementing parity functions is described for some bases. For one infinite basis, an upper bound for the complexity of parity functions is given.

UDC: 519.95

 English version: Journal of Mathematical Sciences (New York), 2018, 233:1, 95–99