Pairs of majority-decomposing functions

DOI10.1016/J.IPL.2018.07.004MaRDI QIDQ1799568zbMATH OpenOpenAlexWikidataFDO

Authors Mathias Soeken, Eleonora Testa, Alan Mishchenko, Giovanni De Micheli

Publication date 19 October 2018

Published in Information Processing Letters (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1016/j.ipl.2018.07.004

zbMATH Keywords

decompositionBoolean functionscombinatorial problemsmajority functionslogic synthesis

Mathematics Subject Classification ID

Switching theory, applications of Boolean algebras to circuits and networks (94C11) Boolean functions (94D10)

Recommendations

• A circuit of depth two with limited input branching for majority functions
• Formula Complexity of Ternary Majorities
• The 2's Complement and Other Semi-Systematic Binary Codes
• scientific article; zbMATH DE number 3865163
• On expressing majority as a majority of majorities

Cites work

• scientific article; zbMATH DE number 3197527 (Why is no real title available?)
• A Bound on the Run Measure of Switching Functions
• Selecting the Median
• The art of computer programming. Volume 4A. Combinatorial algorithms. Part 1.

This page was built for publication: Pairs of majority-decomposing functions

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q1799568)