On the complexity of Boolean functions computed by lazy oracles

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

Ausführliche Beschreibung

Gespeichert in:
Bibliographische Detailangaben
Veröffentlicht in:IEEE transactions on computers Jg. 44; H. 4; S. 495 - 502
Hauptverfasser: Dunne, P.E., Leng, P.H., Nwana, G.F.
Format: Journal Article
Sprache:Englisch
Veröffentlicht: New York, NY IEEE 01.04.1995
Institute of Electrical and Electronics Engineers
Schlagworte:
Applied sciences
Boolean functions
Circuit simulation
Circuit synthesis
Computer science; control theory; systems
Digital systems
Discrete event simulation
Electronics
Exact sciences and technology
Formal verification
Integrated circuits
Logic circuits
Logic design
Logic functions
Logic gates
Logical, boolean and switching functions
Semiconductor electronics. Microelectronics. Optoelectronics. Solid state devices
Simulation
Software
Theoretical computing
Electronic circuit
Boolean function
Symmetric function
Complexity measure
Computational complexity
Simulator
ISSN:0018-9340
Online-Zugang:Volltext
Tags: Tag hinzufügen
Keine Tags, Fügen Sie den ersten Tag hinzu!
Beschreibung
Zusammenfassung: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.< >
Bibliographie:ObjectType-Article-2
SourceType-Scholarly Journals-1
ObjectType-Feature-1
content type line 23
ISSN:0018-9340
DOI:10.1109/12.376165