Issue No.04 - April (1995 vol.44)
DOI Bookmark: http://doi.ieeecomputersociety.org/10.1109/12.376165
<p><it>Abstract</it>—In this paper we introduce and examine some properties of a new complexity measure for Boolean functions. Unlike classical approaches, which are largely concerned with resource requirements, the measure examined here aims at quantifying the potential for lazy evaluation in a function. This measure is motivated by issues arising in the implementation of demand-driven logic simulators. The range of values that can be taken by the measure is precisely identified and a lower bound on the complexity of ’almost all’ Boolean functions derived. In addition asymptotically exact values are derived for the class of all Boolean symmetric functions.</p>
Circuit simulation, Boolean function complexity, demand-driven simulation, symmetric Boolean functions, lazy evaluation.
Paul H. Leng, Gerald F. Nwana, "On the Complexity of Boolean Functions Computed by Lazy Oracles", IEEE Transactions on Computers, vol.44, no. 4, pp. 495-502, April 1995, doi:10.1109/12.376165