Complexity and Structure of Circuits for Parity Functions


如何引用文章

全文:

开放存取 开放存取
受限制的访问 ##reader.subscriptionAccessGranted##
受限制的访问 订阅存取

详细

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.

作者简介

Yu. Kombarov

Moscow State University

编辑信件的主要联系方式.
Email: yuri.kombarov@gmail.com
俄罗斯联邦, Moscow

补充文件

附件文件
动作
1. JATS XML

版权所有 © Springer Science+Business Media, LLC, part of Springer Nature, 2018