Article
Licensed
Unlicensed
Requires Authentication
Complexity of implementation of parity functions in the implication–negation basis
-
Yuriy A. Kombarov
Published/Copyright:
August 7, 2015
Abstract
The paper is concerned with circuits in the basis {x →y ,x̅}. The exact value of the complexity of implementation of an even parity function is obtained and the minimal circuits implementing an odd parity function are described
Received: 2014-9-17
Published Online: 2015-8-7
Published in Print: 2015-8-1
© 2015 by Walter de Gruyter Berlin/Boston
You are currently not able to access this content.
You are currently not able to access this content.
Articles in the same Issue
- Frontmatter
- On groups with automorphisms generating recurrent sequences of the maximal period
- Classification of correlation-immune and minimal correlation-immune Boolean functions of 4 and 5 variables
- Free commutative medial n-ary groupoids
- Complexity of implementation of parity functions in the implication–negation basis
- Closed classed of three-valued logic that contain essentially multiplace functions
- A generalization of Ore’s theorem on irreducible polynomials over a finite field
- Rings whose finitely generated right ideals are quasi-projective
Articles in the same Issue
- Frontmatter
- On groups with automorphisms generating recurrent sequences of the maximal period
- Classification of correlation-immune and minimal correlation-immune Boolean functions of 4 and 5 variables
- Free commutative medial n-ary groupoids
- Complexity of implementation of parity functions in the implication–negation basis
- Closed classed of three-valued logic that contain essentially multiplace functions
- A generalization of Ore’s theorem on irreducible polynomials over a finite field
- Rings whose finitely generated right ideals are quasi-projective
