Repository logo

Infoscience

  • English
  • French
Log In
Logo EPFL, École polytechnique fédérale de Lausanne

Infoscience

  • English
  • French
Log In
  1. Home
  2. Academic and Research Output
  3. Journal articles
  4. Pairs of majority-decomposing functions
 
research article

Pairs of majority-decomposing functions

Soeken, Mathias  
•
Testa, Eleonora
•
Mishchenko, Alan
Show more
July 10, 2018
Information Processing Letters

We are interested in decompositions xnf1f2 of the majority function over n odd arguments x1, ...,xnsuch that f1and f2do not depend on xn. In this paper, we derive the conditions for f1and f2that satisfy the decomposition. Such decompositions play a central role in finding optimum majority-3 networks for the majority-n function

  • Details
  • Metrics
Type
research article
DOI
10.1016/j.ipl.2018.07.004
Author(s)
Soeken, Mathias  
•
Testa, Eleonora
•
Mishchenko, Alan
•
De Micheli, Giovanni
Date Issued

2018-07-10

Published in
Information Processing Letters
Volume

139

Start page

35

End page

38

Subjects

Boolean functionsMajority functionsDecompositionLogic synthesisCombinatorial problems

Editorial or Peer reviewed

REVIEWED

Written at

EPFL

EPFL units
LSI1  
LSI2  
FunderGrant Number

H2020

ERC Cybercare 66935

FNS

SNF MAjesty 200021-169084

Available on Infoscience
August 7, 2018
Use this identifier to reference this record
https://infoscience.epfl.ch/handle/20.500.14299/147672
Logo EPFL, École polytechnique fédérale de Lausanne
  • Contact
  • infoscience@epfl.ch

  • Follow us on Facebook
  • Follow us on Instagram
  • Follow us on LinkedIn
  • Follow us on X
  • Follow us on Youtube
AccessibilityLegal noticePrivacy policyCookie settingsEnd User AgreementGet helpFeedback

Infoscience is a service managed and provided by the Library and IT Services of EPFL. © EPFL, tous droits réservés