Average time of computing Boolean operators Original Research Article

The average time of computing Boolean operators by straight-line programs of two types is studied. Upper and lower bounds for the corresponding Shannon functions are obtained. Asymptotically exact formulas for Shannon functions are derived in the case when the number of components of the operators to be computed increases with the number of their arguments.