A universal lower-bound technique for the size and other implementation characteristics of an arbitrary Boolean function as a decision tree and as a two-level AND/OR circuit is derived. The technique is based on the power spectrum coefficients of the
Published in:
Computers, IEEE Transactions on
(Volume:39
,
Issue:
2
)
Date of Publication: Feb 1990