Reference : On compositions of clones of Boolean functions
Scientific congresses, symposiums and conference proceedings : Paper published in a book
Physical, chemical, mathematical & earth Sciences : Mathematics
http://hdl.handle.net/10993/3290
On compositions of clones of Boolean functions
English
Couceiro, Miguel mailto [University of Tampere, Finland]
Foldes, Stephan mailto [Tampere University of Technology, Finland]
Lehtonen, Erkko mailto [Tampere University of Technology, Finland]
2004
International Conference of Computational Methods in Sciences and Engineering 2004 (ICCMSE 2004)
Simos, T.
Maroulis, G.
VSP/Brill
849-851
Yes
No
International
9789067644181
International Conference Of Computational Methods In Sciences And Engineering (ICCMSE 2004)
19-23 November 2004
Attica
Greece
[en] function class composition ; clones ; Boolean functions ; Post Classes ; class factorization ; normal forms ; DNF ; CNF ; Zhegalkin polynomial ; applications of universal algebra in computer science
[en] We present some compositions of clones of Boolean functions that imply factorizations of ?, the clone of all Boolean functions, into minimal clones. These can be interpreted as representation theorems, providing representations of Boolean functions analogous to the disjunctive normal form, the conjunctive normal form, and the Zhegalkin polynomial representations.
http://hdl.handle.net/10993/3290
International Conference of Computational Methods in Sciences and Engineering 2004 (ICCMSE 2004)

File(s) associated to this reference

Fulltext file(s):

FileCommentaryVersionSizeAccess
Limited access
ICCMSE2004.pdfAuthor preprint177.18 kBRequest a copy

Bookmark and Share SFX Query

All documents in ORBilu are protected by a user license.