Enviar artigo por via de e-mail Complexity and Structure of Circuits for Parity Functions
- Autores: Kombarov Y.1
-
Afiliações:
- Moscow State University
- Edição: Volume 233, Nº 1 (2018)
- Páginas: 95-99
- Seção: Article
- URL: https://journals.rcsi.science/1072-3374/article/view/241522
- DOI: https://doi.org/10.1007/s10958-018-3926-6
- ID: 241522
Citar
Acesso aberto
Acesso está concedido
Somente assinantes
Resumo
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.
Sobre autores
Yu. Kombarov
Moscow State University
Autor responsável pela correspondência
Email: yuri.kombarov@gmail.com
Rússia, Moscow
