Additional information
Translated from Kibernetika, No. 3, p. 148, May–June, 1971.
Rights and permissions
About this article
Cite this article
Baum, É.L. Upper bound on the number of letters in a minimal formula of depth N of the function F=(x1+...+xn)mod 2. Cybern Syst Anal 7, 570–571 (1971). https://doi.org/10.1007/BF01070465
Received:
Issue Date:
DOI: https://doi.org/10.1007/BF01070465