DocumentCode
2136919
Title
Several remarks on the complexity of set-valued switching functions
Author
Simovici, Dan A. ; Reischer, Corina
Author_Institution
Dept. of Math. & Comput. Sci., Massachusetts Univ., Boston, MA, USA
fYear
1996
fDate
29-31 May 1996
Firstpage
166
Lastpage
170
Abstract
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
Keywords
Boolean algebra; computational complexity; switching functions; Boolean components; complete basis; complexity; complexity of circuits; non-Boolean components; set-valued logic functions; set-valued switching functions; Biology computing; Boolean algebra; Boolean functions; Integrated circuit interconnections; Logic circuits; Logic devices; Logic functions; Molecular computing; Optical computing; Switching circuits;
fLanguage
English
Publisher
ieee
Conference_Titel
Multiple-Valued Logic, 1996. Proceedings., 26th International Symposium on
Conference_Location
Santiago de Compostela
ISSN
0195-623X
Print_ISBN
0-8186-7392-3
Type
conf
DOI
10.1109/ISMVL.1996.508355
Filename
508355
Link To Document