论文信息 - A 2.5 n-lower bound on the combinational complexity of Boolean functions

A 2.5 n-lower bound on the combinational complexity of Boolean functions

Consider the combinational complexity L(f) of Boolean functions over the basis Ω &equil; {f¦ f:{0,1}<supscrpt>2</supscrpt> → {0,1}}. A new Method for proving linear lower bounds of size 2n is presented. Combining it with methods presented in [12] and [15], we establish for a special sequence of functions f<supscrpt>n</supscrpt>:{0,1}<supscrpt>n</supscrpt> → {0,1}: 2.5n ≤ L(f) &le 6n. Also a trade-off result between circuit complexity and formula size is derived.

Wolfgang J. Paul

[1] Mike Paterson,et al. Complexity of Monotone Networks for Boolean Matrix Product , 1974, Theor. Comput. Sci..

[2] E. A. Lamagna,et al. Combinational Complexity of Some Monotone Functions , 1974, SWAT.

[3] Vaughan R. Pratt,et al. The power of negative thinking in multiplying Boolean matrices , 1974, STOC '74.

[4] Larry Joseph Stockmeyer,et al. The complexity of decision problems in automata theory and logic , 1974 .

[5] Wolfgang J. Paul. A 2.5 n-Lower Bound on the Combinational Complexity of Boolean Functions , 1977, SIAM J. Comput..

[6] John E. Savage,et al. Computational Work and Time on Finite Machines , 1972, JACM.

[7] Claus-Peter Schnorr. Lower Bounds for the Product of Time and Space Requirements of Turing Machine Computations , 1973, MFCS.

[8] Stephen A. Cook,et al. The complexity of theorem-proving procedures , 1971, STOC.