Abstract
This paper explores the connections between two areas pioneered by Shannon: the transmission of information with a fidelity criterion, and the realization of Boolean functions by networks and formulae. We study three phenomena:
-
1.
The effect of the relative number of O's and l's in a function's table on its complexity.
-
2.
The effect of the number of unspecified entries in a partially specified function's table on its complexity.
-
3.
The effect of the number of errors allowed in the realization of a function on its complexity.
Our main result is a precise version of the following statement:
The complexity of approximately realizing a partially specified Boolean function, in whose table a fractiond of the entries are unspecified and a fractionp of the specified entries are l'swith errors allowed in a fraction not more thane of the specified entries, is less by the factor (1 −d) [H(p) − H(e)] (whereH(z) = −z log2 z −(1 −z) log2 (1 −z) is the binary entropy function) than the complexity of exactly realizing an arbitrary fully specified Boolean function.
We also give an intuitively appealing information-theoretic interpretation of the result.
This is a preview of subscription content, log in via an institution to check access.
Similar content being viewed by others
References
R. W. Cook andM. J. Flynn, Logical network cost and entropy,IEEE Trans. on Comp.,22 (Sept. 1973) 823–826.
R. W. Hamming, Error detecting and error correcting codes,Bell Syst. Tech. J.,29 (Apr. 1950) 147–160.
R. E. Krichevskii, Realization of functions by superpositions,Prob. of Cyb.,2 (1959) 458–477.
O. B. Lupanov, Ob odnom metode sinteza skhem,Izv. VUZ (Radiofizika),1 (Jan. 1958) 120–140.
O. B. Lupanov, Complexity of formula realization of functions of logical algebra,Prob. of Cyb. 3 (1960) 782–811.
O. B. Lupanov, Ob odnom podkhode k sintezu upravlyayushchykh sistem—printsipe lokalnogo kodirovaniya,Prob. Kib.,14 (1965) 31–110.
D. E. Muller, Complexity in electronic switching circuits,IRE Trans. on EC,5 (Mar. 1956) 15–19.
E. I. Nechiporuk, Complexity of gating circuits which are realized by Boolean matrices with undetermined elements,Sov. Phys. Dokl.,10 (Jan. 1966) 591–593.
J. Pearl,On the complexity of inexact computations, UCLA Eng. Paper 0775 (July 1975) 19 pp.
W. W. Peterson,Error-correcting codes, MIT Press, Cambridge, Mass., 1961.
N. J. Pippenger, Information theory and the complexity of switching networks,16th Ann. IEEE Symp. on Found. Comp. Sci., Berkeley, 1975, pp. 113–118.
A. Schönhage andV. Strassen, Schnelle Multiplikation grosser Zahlen,Computing,7 (1971) 281–292.
C. E. Shannon, A mathematical theory of communication,Bell Syst. Tech. J.,27 (July 1948) 379–423 and27 (Oct. 1948) 623–656.
C. E. Shannon, The synthesis of two-terminal switching circuits,Bell Syst. Tech. J.,28 (Jan. 1949) 59–98.
C. E. Shannon, Coding theorems for a discrete source with a fidelity criterion,IRE Nat. Conv. Rec. (Mar. 1959) pt. 4, pp. 142–163.
L. A. Sholomov, O realizatsii nedoopredelennykh bulevykh funktsii skhemami iz funktsionalnykh elementov,Prob. Kib.,21 (1969) 215–226.
S. K. Stein, Two combinatorial covering theorems,J. of Comb. Theory (A),16 (1974) 391–397.
Author information
Authors and Affiliations
Rights and permissions
About this article
Cite this article
Pippenger, N. Information theory and the complexity of boolean functions. Math. Systems Theory 10, 129–167 (1976). https://doi.org/10.1007/BF01683269
Received:
Revised:
Issue Date:
DOI: https://doi.org/10.1007/BF01683269