Showing a limited preview of this publication:
We consider the complexity of realisation of the monotone functions by straight-line programs with conditional stop. It is shown that the mean complexity of each monotone function of n variables does not exceed a2n/n2 (1 + o(1)) as n → ∞, and the mean complexity of almost all monotone functions of n variables is at least b2n/n2 (1 + o(1)) as n → ∞, where a and b are constants.
Published Online: 2006-03-01
Published in Print: 2006-03-01
Copyright 2006, Walter de Gruyter
