On the Complexity of Boolean Functions Computed by Lazy Oracles

Authors:
Paul H. Leng;Paul E. Dunne;Gerald F. Nwana
Affiliations:
-;-;-
Venue:
IEEE Transactions on Computers
Year:
1995

Citing 4
Cited 1

Demand driven simulation: BACKSIM

DAC '87 Proceedings of the 24th ACM/IEEE Design Automation Conference
The complexity of Boolean networks

The complexity of Boolean networks
Exclusive simulation of activity in digital networks

Communications of the ACM
A lazy evaluator

POPL '76 Proceedings of the 3rd ACM SIGACT-SIGPLAN symposium on Principles on programming languages

Demand-driven logic simulation using a network of loosely coupled processors

Journal of Systems Architecture: the EUROMICRO Journal

Quantified Score

Hi-index	14.98

Visualization

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 (see, e.g., [3]), 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, [1], [7], [8], [12]. 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.