For Full-Text PDF, please login, if you are a member of IEICE,|
or go to Pay Per View on menu list, if you are a nonmember of IEICE.
On the Number of Negations Needed to Compute Parity Functions
Tetsuro NISHINO Jaikumar RADHAKRISHNAN
IEICE TRANSACTIONS on Information and Systems
Publication Date: 1995/01/25
Print ISSN: 0916-8532
Type of Manuscript: LETTER
Category: Algorithm and Computational Complexity
computational complexity, boolean circuit, parity function,
Full Text: PDF(152.1KB)
>>Buy this Article
We exactly determine the number of negations needed to compute the parity functions and the complement of the parity functions. We show that with k NOT gates, parity can be computed on at most 2k+11 variables, and parity complement on at most 2k+12 variables. The two bounds are shown to be tight.