A circuit of depth two with limited input branching for majority functions

DOI10.3103/S0027132218050054MaRDI QIDQ1725545zbMATH OpenOpenAlexWikidataFDO

Authors Yu. A. Kombarov

Publication date 14 February 2019

Published in Moscow University Mathematics Bulletin (Search for Journal in Brave)

Full work available at URL https://doi.org/10.3103/s0027132218050054

Mathematics Subject Classification ID

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

Recommendations

• Computing majority by constant depth majority circuits with low fan-in gates
• Computing majority by constant depth majority circuits with low fan-in gates
• When do extra majority gates help? Polylog\((N)\) majority gates are equivalent to one
• Threshold functions and bounded depth monotone circuits
• A note on the power of majority gates and modular gates

Cites work

• Computing majority by constant depth majority circuits with low fan-in gates

Cited in

(10)

• Pairs of majority-decomposing functions
• Computing majority by constant depth majority circuits with low fan-in gates
• Bounds on the Size of Small Depth Circuits for Approximating Majority
• Explicit Constructions of Depth-2 Majority Circuits for Comparison and Addition
• Computing majority by constant depth majority circuits with low fan-in gates
• Depth two majority circuits for majority and list expanders
• Lower Bounds on Balancing Sets and Depth-2 Threshold Circuits
• On expressing majority as a majority of majorities
• A note on the power of majority gates and modular gates
• Chair of Discrete Mathematics

This page was built for publication: A circuit of depth two with limited input branching for majority functions

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