Email this article Complexity and Structure of Circuits for Parity Functions
- Authors: Kombarov Y.A.1
-
Affiliations:
- Moscow State University
- Issue: Vol 233, No 1 (2018)
- Pages: 95-99
- Section: Article
- URL: https://bakhtiniada.ru/1072-3374/article/view/241522
- DOI: https://doi.org/10.1007/s10958-018-3926-6
- ID: 241522
Cite item
Open Access
Access granted
Subscription Access
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.
About the authors
Yu. A. Kombarov
Moscow State University
Author for correspondence.
Email: yuri.kombarov@gmail.com
Russian Federation, Moscow
Supplementary files
