This Article 
 Bibliographic References 
 Add to: 
On the Complexity of Boolean Functions Computed by Lazy Oracles
April 1995 (vol. 44 no. 4)
pp. 495-502

Abstract—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.

[1] C.C. Charlton,D. Jackson,P.H. Leng,“Lazy simulation of digital logic,” Computer Aided Design, vol. 23, no. 7, pp. 506-513, 1991.
[2] H. Chernoff,“A measure of asymptotic efficiency for tests of a hypothesisbased on the sum of observations,” Ann. Math. Stat., vol. 23, pp. 493-509, 1952.
[3] P.E. Dunne,The Complexity of Boolean Networks, Academic Press, 1988.
[4] P.E. Dunne and P.H. Leng,“An algorithm for optimizing signal selection indemand-driven circuit simulation,” Trans. Soc. Computer Simulation, vol. 8, no. 4, pp. 269-280, Dec. 1991.
[5] P.E. Dunne,P.H. Leng,, and G.F. Nwana,“Distributed logic simulation on anetwork of Unix workstations,” Proc. UKUUG and SUN UK User Group Joint New Year 1993 Conf., pp. 61-71, Jan. 1993.
[6] P. Henderson and J. Morris,“A lazy evaluator,” Proc. Third ACM Symp.Principles of Programming Languages, pp. 95-103, 1976.
[7] D. Jackson,“The generation of systems for microarchitectural simulation,” PhD dissertation, Univ. of Liverpool, 1986.
[8] D. Jackson,C.C. Charlton,, and P.H. Leng,“Modeling and simulation ofdigital logic: An alternative approach,” Proc. 16th IASTED Int’l Symp.Identification, Modeling, and Simulation, pp. 86-90,Paris, 1987.
[9] A.D. Korshunov,“On the number of monotone Boolean functions,” Problemy Kibernet., vol. 38, pp. 5-108 (In Russian; English summary in [3], pp. 146-7), 1981.
[10] J. Riordan and C.E. Shannon,“The number of two-terminal series-parallel networks,” J. Math. and Phys., vol. 21, pp. 83-93, 1942.
[11] C.E. Shannon,“The synthesis of two-terminal switching circuits,” Bell Syst. Tech. J., vol. 28, pp. 59-98, 1949.
[12] S.P. Smith,M.R. Mercer,, and B. Brock,“Demand-driven simulation: BACKSIM,” Proc. 24th ACM/IEEE Design Automation Conf., pp. 181-187, 1987.
[13] S.A. Syzgenda and E.W. Thompson,“Digital logic simulation in a time-basedtable-driven environment, Part 1: Design verification,” Computer, pp. 24-36, 1975.
[14] E.G. Ulrich,“Exclusive simulation of activity in digital networks,” Comm. ACM, vol. 12, no. 2, pp. 102-110, 1969.

Index Terms:
Circuit simulation, Boolean function complexity, demand-driven simulation, symmetric Boolean functions, lazy evaluation.
Paul H. Leng, Paul E. Dunne, 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
Usage of this product signifies your acceptance of the Terms of Use.