Reference : An algorithm for producing median formulas for Boolean functions
Scientific congresses, symposiums and conference proceedings : Paper published in a book
Physical, chemical, mathematical & earth Sciences : Mathematics
Engineering, computing & technology : Computer science
http://hdl.handle.net/10993/9596
An algorithm for producing median formulas for Boolean functions
English
Couceiro, Miguel mailto [University of Luxembourg > Faculty of Science, Technology and Communication (FSTC) > Mathematics Research Unit >]
Lehtonen, Erkko mailto [University of Luxembourg > Faculty of Science, Technology and Communication (FSTC) > Computer Science and Communications Research Unit (CSC) >]
Marichal, Jean-Luc mailto [University of Luxembourg > Faculty of Science, Technology and Communication (FSTC) > Mathematics Research Unit >]
Waldhauser, Tamás mailto [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.
University of Luxembourg - UL
Researchers ; Professionals ; Students
http://hdl.handle.net/10993/9596
http://ticsp.cs.tut.fi/RM2011/

File(s) associated to this reference

Fulltext file(s):

FileCommentaryVersionSizeAccess
Open access
MedianR-M2011.pdfAuthor postprint160.92 kBView/Open
Limited access
paper7.pdfPublisher postprint5.58 MBRequest a copy

Additional material(s):

File Commentary Size Access
Open access
Talk-ReedMuller.pdfSlides135.45 kBView/Open

Bookmark and Share SFX Query

All documents in ORBilu are protected by a user license.