On the complexity of realization of partial Boolean functions by circuits of functional elements

DOI10.1515/DMA.1991.1.3.251zbMath0733.94026OpenAlexW2010704148MaRDI QIDQ3360808

Alexander E. Andreev

Publication date: 1991

Published in: Discrete Mathematics and Applications (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1515/dma.1991.1.3.251

zbMATH Keywords

Boolean circuitscombinational complexitycomputing partial Boolean functionsShannons function

Mathematics Subject Classification ID

Combinatorics in computer science (68R05)

Related Items (4)

Efficient constructions of Hitting Sets for systems of linear functions ⋮ On the average-case complexity of underdetermined functions ⋮ Optimal bounds for the approximation of Boolean functions and some applications ⋮ THEORETICALLY EFFECTIVE ASYMPTOTICALLY OPTIMAL UNIVERSAL CODING OF PARTIALLY DEFINED SOURCES

This page was built for publication: On the complexity of realization of partial Boolean functions by circuits of functional elements