[en] We review various normal form representations of Boolean functions and outline a comparative study between them, which shows that the median normal form system provides representations that are more efficient than the classical DNF, CNF and Reed–Muller (polynomial) normal form representations. We present an algorithm for producing median normal form representations of Boolean functions.
Disciplines :
Mathématiques Sciences informatiques
Auteur, co-auteur :
COUCEIRO, Miguel ; University of Luxembourg > Faculty of Science, Technology and Communication (FSTC) > Mathematics Research Unit
LEHTONEN, Erkko ; University of Luxembourg > Faculty of Science, Technology and Communication (FSTC) > Computer Science and Communications Research Unit (CSC)
MARICHAL, Jean-Luc ; University of Luxembourg > Faculty of Science, Technology and Communication (FSTC) > Mathematics Research Unit
WALDHAUSER, Tamás ; University of Luxembourg > Faculty of Science, Technology and Communication (FSTC) > Mathematics Research Unit
Langue du document :
Anglais
Titre :
An algorithm for producing median formulas for Boolean functions
