Explicit Constructions of Depth-2 Majority Circuits for Comparison and Addition
From MaRDI portal
Publication:4287934
DOI10.1137/S0895480191218496zbMath0802.68068MaRDI QIDQ4287934
Publication date: 12 May 1994
Published in: SIAM Journal on Discrete Mathematics (Search for Journal in Brave)
Lua error in Module:PublicationMSCList at line 37: attempt to index local 'msc_result' (a nil value).
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