skip to main content
OSTI.GOV title logo U.S. Department of Energy
Office of Scientific and Technical Information

Title: Complexity and Structure of Circuits for Parity Functions

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.

Authors:
 [1]
  1. Moscow State University (Russian Federation)
Publication Date:
OSTI Identifier:
22773912
Resource Type:
Journal Article
Journal Name:
Journal of Mathematical Sciences
Additional Journal Information:
Journal Volume: 233; Journal Issue: 1; Other Information: Copyright (c) 2018 Springer Science+Business Media, LLC, part of Springer Nature; http://www.springer-ny.com; Country of input: International Atomic Energy Agency (IAEA); Journal ID: ISSN 1072-3374
Country of Publication:
United States
Language:
English
Subject:
97 MATHEMATICAL METHODS AND COMPUTING; DATA; FUNCTIONS; PARITY; REVIEWS

Citation Formats

Kombarov, Yu. A., E-mail: yuri.kombarov@gmail.com. Complexity and Structure of Circuits for Parity Functions. United States: N. p., 2018. Web. doi:10.1007/S10958-018-3926-6.
Kombarov, Yu. A., E-mail: yuri.kombarov@gmail.com. Complexity and Structure of Circuits for Parity Functions. United States. doi:10.1007/S10958-018-3926-6.
Kombarov, Yu. A., E-mail: yuri.kombarov@gmail.com. Wed . "Complexity and Structure of Circuits for Parity Functions". United States. doi:10.1007/S10958-018-3926-6.
@article{osti_22773912,
title = {Complexity and Structure of Circuits for Parity Functions},
author = {Kombarov, Yu. A., E-mail: yuri.kombarov@gmail.com},
abstractNote = {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.},
doi = {10.1007/S10958-018-3926-6},
journal = {Journal of Mathematical Sciences},
issn = {1072-3374},
number = 1,
volume = 233,
place = {United States},
year = {2018},
month = {8}
}