Decomposition of threshold functions into bounded fan-in threshold functions

DOI10.1016/J.IC.2013.04.002zbMATH Open1358.94114OpenAlexW2003396577MaRDI QIDQ383374FDOQ383374

Authors: Viswanath Annampedu, Meghanad D. Wagh 

Publication date: 4 December 2013

Published in: Information and Computation (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1016/j.ic.2013.04.002

Recommendations

• On the power of small-depth threshold circuits
• On the functional separability of Boolean threshold functions
• Approximating threshold circuits by rational functions
• Size--Depth Tradeoffs for Threshold Circuits
• Linear-size constant-depth polylog-threshold circuits

zbMATH Keywords

decompositioncomparison functionthreshold functionsbounded fan-inmajority logic

Mathematics Subject Classification ID

Cites Work

• Majority gates vs. general weighted threshold gates
• On Optimal Depth Threshold Circuits for Multiplication and Related Problems
• On the power of small-depth threshold circuits
• Threshold circuits of bounded depth
• Title not available (Why is that?)
• On the Power of Threshold Circuits with Small Weights
• Threshold circuits of small majority-depth
• Uniform constant-depth threshold circuits for division and iterated multiplication.
• Uniform and regular structures for realization of symmetric functions of the algebra of logic
• Explicit Constructions of Depth-2 Majority Circuits for Comparison and Addition
• Simulating Threshold Circuits by Majority Circuits
• Signed digit addition and related operations with threshold logic
• On small depth threshold circuits

This page was built for publication: Decomposition of threshold functions into bounded fan-in threshold functions

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