Boolean Functions with a Large Number of Subfunctions and Small Complexity and Depth
暂无分享,去创建一个
If f(x1,...,xn) is a Boolean function on the variables x1,...,xn then f(*1,...,*n) where *i ∈ {0, 1, xi}, i = 1,...,n, is called subfunction of f. The number of subfunctions of f is at most 3n. Intuition suggests that a Boolean function with a large number of subfunctions has a large (combinatorial) complexity and a large depth. We show that this intuition is wrong. There exist Boolean functions with about 3n subfunctions (i. e. about the maximal number of subfunctions) and with a very small complexity and depth (about 2n and log2n, respectively).
[1] John E. Savage,et al. The Complexity of Computing , 1976 .
[2] Claus-Peter Schnorr. A 3n-Lower Bound on the Network Complexity of Boolean Functions , 1980, Theor. Comput. Sci..
[3] L. H. Harper,et al. A Class of Boolean Functions with Linear Combinational Complexity , 1975, Theor. Comput. Sci..
[4] Norbert Blum. A Boolean Function Requiring 3n Network Size , 1984, Theor. Comput. Sci..
[5] Ingo Wegener,et al. The complexity of Boolean functions , 1987 .