Publication

Pairs of majority-decomposing functions

Mathias Soeken
2018
Journal Articles

Abstract

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 ﬁnding optimum majority-3 networks for the majority-n function

Official source

Graph Chat

Chat with Graph Search

Ask any question about EPFL courses, lectures, exercises, research, news, etc. or try the example questions below.

DISCLAIMER: The Graph Chatbot is not programmed to provide explicit or categorical answers to your questions. Rather, it transforms your questions into API requests that are distributed across the various IT services officially administered by EPFL. Its purpose is solely to collect and recommend relevant references to content that you can explore to help you answer your questions.

Pairs of majority-decomposing functions

Chat with Graph Search

Climbing into their Skin to Understand Contextual Protein-Protein Associations and Localizations: Functional Investigations in Transgenic Live Model Organisms

Stable parameterization of continuous and piecewise-linear functions

Debates on the dorsomedial prefrontal/dorsal anterior cingulate cortex: insights for future research