Explicit Constructions of Depth-2 Majority Circuits for Comparison and Addition

DOI10.1137/S0895480191218496zbMath0802.68068MaRDI QIDQ4287934

Noga Alon, Jehoshua Bruck

Publication date: 12 May 1994

Published in: SIAM Journal on Discrete Mathematics (Search for Journal in Brave)

zbMATH Keywords

threshold functionerror-correcting codescomparison functionmajority circuitsaddition function

Mathematics Subject Classification ID

Linear codes (general theory) (94B05) Hardware implementations of nonnumerical algorithms (VLSI algorithms, etc.) (68W35)

Related Items (8)

On small depth threshold circuits ⋮ General-Purpose Computation with Neural Networks: A Survey of Complexity Theoretic Results ⋮ Computing sparse approximations deterministically ⋮ Reflections on ``Representations of sets of Boolean functions by commutative rings by Roman Smolensky ⋮ Decomposition of threshold functions into bounded fan-in threshold functions ⋮ Depth-efficient threshold circuits for multiplication and symmetric function computation ⋮ Counting Solutions to Polynomial Systems via Reductions ⋮ Threshold circuits of small majority-depth

This page was built for publication: Explicit Constructions of Depth-2 Majority Circuits for Comparison and Addition