Thats a unique idea.You should consider the following idea to enhance your idea so that it would impact uniquely:  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 lor 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. >
['Paul E. Dunne', 'Paul H. Leng', 'Gerald F. Nwana']
I am writing a research paper on a idea On the complexity of Boolean functions computed by lazy oracles
[{"from": "human", "value": "I am writing a research paper on a idea On the complexity of Boolean functions computed by lazy oracles"}, {"from": "gpt", "value": "Thats a unique idea.You should consider the following idea to enhance your idea so that it would impact uniquely:  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 lor 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. >"}]