×

zbMATH — the first resource for mathematics

On the complexity of realization of partial Boolean functions by circuits of functional elements. (English. Russian original) Zbl 0733.94026
Discrete Math. Appl. 1, No. 3, 251-261 (1991); translation from Diskretn. Mat. 1, No. 4, 36-45 (1989).
Summary: See the review in Zbl 0719.94028.

MSC:
94C10 Switching theory, application of Boolean algebra; Boolean functions (MSC2010)
68R05 Combinatorics in computer science
PDF BibTeX XML Cite
Full Text: DOI