Pages that link to "Item:Q4388870"
From MaRDI portal
The following pages link to Simulating Threshold Circuits by Majority Circuits (Q4388870):
Displaying 12 items.
- Decomposition of threshold functions into bounded fan-in threshold functions (Q383374) (← links)
- Powering requires threshold depth 3 (Q845974) (← links)
- Monotone circuits for monotone weighted threshold functions (Q1044746) (← links)
- Monotone Boolean formulas can approximate monotone linear threshold functions (Q1878411) (← links)
- Bounded depth circuits with weighted symmetric gates: satisfiability, lower bounds and compression (Q2316930) (← links)
- Cryptographic hardness for learning intersections of halfspaces (Q2517820) (← links)
- Quantum matchgate computations and linear threshold gates (Q3076715) (← links)
- A new theorem in threshold logic and its application to multioperand binary adders (Q4467334) (← links)
- General-Purpose Computation with Neural Networks: A Survey of Complexity Theoretic Results (Q4819851) (← links)
- Quantified Derandomization: How to Find Water in the Ocean (Q5060673) (← links)
- A Short List of Equalities Induces Large Sign-Rank (Q5087014) (← links)
- On the complexity of algebraic numbers, and the bit-complexity of straight-line programs1 (Q6048002) (← links)
