Complexity and Structure of Circuits for Parity Functions
- Авторлар: Kombarov Y.1
-
Мекемелер:
- Moscow State University
- Шығарылым: Том 233, № 1 (2018)
- Беттер: 95-99
- Бөлім: Article
- URL: https://journals.rcsi.science/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.
Авторлар туралы
Yu. Kombarov
Moscow State University
Хат алмасуға жауапты Автор.
Email: yuri.kombarov@gmail.com
Ресей, Moscow