Jaikumar RADHAKRISHNAN


On the Number of Negations Needed to Compute Parity Functions
Tetsuro NISHINO Jaikumar RADHAKRISHNAN 
Publication:   IEICE TRANSACTIONS on Information and Systems
Publication Date: 1995/01/25
Vol. E78-D  No. 1  pp. 90-91
Type of Manuscript:  LETTER
Category: Algorithm and Computational Complexity
Keyword: 
computational complexityboolean circuitparity function
 Summary | Full Text:PDF(152.1KB)