The complexity of computing symmetric functions using threshold circuits
From MaRDI portal
Publication:1193637
DOI10.1016/0304-3975(92)90372-MzbMath0780.68052OpenAlexW2124321692MaRDI QIDQ1193637
Erik Brisson, Richard E. Ladner, P. W. Beame
Publication date: 27 September 1992
Published in: Theoretical Computer Science (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1016/0304-3975(92)90372-m
Lua error in Module:PublicationMSCList at line 37: attempt to index local 'msc_result' (a nil value).
Related Items (4)
Circuit lower bounds from learning-theoretic approaches ⋮ Quantified Derandomization: How to Find Water in the Ocean ⋮ Depth-efficient threshold circuits for multiplication and symmetric function computation ⋮ A new theorem in threshold logic and its application to multioperand binary adders
Cites Work
- Unnamed Item
- Unnamed Item
- Unnamed Item
- \(\Sigma_ 1^ 1\)-formulae on finite structures
- Lower bounds on the size of bounded depth circuits over a complete basis with logical addition
- Parallel computation with threshold functions
- Parity, circuits, and the polynomial-time hierarchy
- Constant Depth Reducibility
- Bounds to Complexities of Networks for Sorting and for Switching
This page was built for publication: The complexity of computing symmetric functions using threshold circuits
