Reference : Set-reconstructibility of Post classes
E-prints/Working papers : Already available on another site
Physical, chemical, mathematical & earth Sciences : Mathematics
http://hdl.handle.net/10993/11351
Set-reconstructibility of Post classes
English
Couceiro, Miguel []
Lehtonen, Erkko mailto [University of Luxembourg > Faculty of Science, Technology and Communication (FSTC) > Computer Science and Communications Research Unit (CSC) >]
Schölzel, Karsten mailto [University of Luxembourg > Faculty of Science, Technology and Communication (FSTC) > Mathematics Research Unit >]
2013
No
[en] The clones of Boolean functions are classified in regard to set-reconstructibility via a strong dichotomy result: the clones containing only affine functions, conjunctions, disjunctions or constant functions are set-reconstructible, whereas the remaing clones are not weakly reconstructible.
http://hdl.handle.net/10993/11351
http://arxiv.org/abs/1310.7797

There is no file associated with this reference.

Bookmark and Share SFX Query

All documents in ORBilu are protected by a user license.