Several remarks on the complexity of set-valued switching functions

Several remarks on the complexity of set-valued switching functions

We explore the complexity of circuits that implement set-valued logic functions on a complete basis that we propose in this paper. This basis is related to the bases used in the main sources on this subject, as we show in Section 2. After discussing properties of the constituents of this basis (whic...

Ausführliche Beschreibung

Gespeichert in:
Bibliographische Detailangaben
Hauptverfasser: Simovici, D.A., Reischer, C.
Format: Tagungsbericht
Sprache:eng
Schlagworte:
Biology computing
Boolean algebra
Boolean functions
Integrated circuit interconnections
Logic circuits
Logic devices
Logic functions
Molecular computing
Optical computing
Switching circuits
Online-Zugang:Volltext bestellen
Tags: Tag hinzufügen
Keine Tags, Fügen Sie den ersten Tag hinzu!
Beschreibung
Zusammenfassung:We explore the complexity of circuits that implement set-valued logic functions on a complete basis that we propose in this paper. This basis is related to the bases used in the main sources on this subject, as we show in Section 2. After discussing properties of the constituents of this basis (which consist of both Boolean and non-Boolean components) we prove that almost all set-valued functions require a large number of Boolean components.
ISSN:0195-623X
2378-2226
DOI:10.1109/ISMVL.1996.508355