On estimating the implementation complexity of boolean formulae in terms of tree-like structures of adjustible modules

The upper ,and lower estimates are obtained for complexity of hardware implementation of a Boolean formula by adjustable modules universal in the class of formulae.