|
Fundamentalnaya i Prikladnaya Matematika, 2015, Volume 20, Issue 6, Pages 147–153
(Mi fpm1690)
|
|
|
|
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.
Citation:
Yu. A. Kombarov, “Complexity and structure of circuits for parity functions”, Fundam. Prikl. Mat., 20:6 (2015), 147–153; J. Math. Sci., 233:1 (2018), 95–99
Linking options:
https://www.mathnet.ru/eng/fpm1690 https://www.mathnet.ru/eng/fpm/v20/i6/p147
|
Statistics & downloads: |
Abstract page: | 292 | Full-text PDF : | 212 | References: | 47 |
|