Complexity and Structure of Circuits for Parity Functions
- 作者: Kombarov Y.A.1
-
隶属关系:
- Moscow State University
- 期: 卷 233, 编号 1 (2018)
- 页面: 95-99
- 栏目: Article
- URL: https://bakhtiniada.ru/1072-3374/article/view/241522
- DOI: https://doi.org/10.1007/s10958-018-3926-6
- ID: 241522
如何引用文章
详细
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.
补充文件
