Login / Signup
On the Number of Negations Needed to Compute Parity Functions.
Tetsuro Nishino
Jaikumar Radhakrishnan
Published in:
IEICE Trans. Inf. Syst. (1995)
Keyphrases
</>
website
fixed number
social networks
case study
wide range
computational complexity
expert systems
information technology
small number
computational effort