Simulating Threshold Circuits by Majority Circuits
From MaRDI portal
Recommendations
Cited in
(19)- Monotone circuits for monotone weighted threshold functions
- Majority gates vs. general weighted threshold gates
- Threshold circuits of small majority-depth
- Monotone Boolean formulas can approximate monotone linear threshold functions
- Bounded depth circuits with weighted symmetric gates: satisfiability, lower bounds and compression
- Cryptographic hardness for learning intersections of halfspaces
- Quantum matchgate computations and linear threshold gates
- Decomposition of threshold functions into bounded fan-in threshold functions
- On Threshold Circuits and Polynomial Computation
- A new theorem in threshold logic and its application to multioperand binary adders
- General-Purpose Computation with Neural Networks: A Survey of Complexity Theoretic Results
- Quantified Derandomization: How to Find Water in the Ocean
- A short list of equalities induces large sign-rank
- Multiparty karchmer: wigderson games and threshold circuits
- Multiparty Karchmer-Wigderson games and threshold circuits
- On the complexity of algebraic numbers, and the bit-complexity of straight-line programs1
- A note on the simulation of exponential threshold weights
- A first-principles theory of slow thinking and active perception
- Powering requires threshold depth 3
This page was built for publication: Simulating Threshold Circuits by Majority Circuits
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q4388870)
