| Article ID | Journal | Published Year | Pages | File Type |
|---|---|---|---|---|
| 6874113 | Information Processing Letters | 2018 | 4 Pages |
Abstract
We are interested in decompositions ãxnf1f2ã of the majority function over n odd arguments x1,â¦,xn such that f1 and f2 do not depend on xn. In this paper, we derive the conditions for f1 and f2 that satisfy the decomposition. Such decompositions play a central role in finding optimum majority-3 networks for the majority-n function.
Related Topics
Physical Sciences and Engineering
Computer Science
Computational Theory and Mathematics
Authors
Mathias Soeken, Eleonora Testa, Alan Mishchenko, Giovanni De Micheli,