An algorithm for producing median formulas for Boolean functions
English
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]
Jul-2011
Proc. of the Reed Muller 2011 Workshop
49-54
Yes
No
International
Reed Muller 2011 Workshop
from 25-05-2011 to 26-05-2011
Tuusula
Finland
[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.