[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.
Disciplines :
Mathématiques
Auteur, co-auteur :
Couceiro, Miguel
LEHTONEN, Erkko ; University of Luxembourg > Faculty of Science, Technology and Communication (FSTC) > Computer Science and Communications Research Unit (CSC)
SCHÖLZEL, Karsten ; University of Luxembourg > Faculty of Science, Technology and Communication (FSTC) > Mathematics Research Unit
