Pages that link to "Item:Q685717"
From MaRDI portal
The following pages link to On the power of small-depth threshold circuits (Q685717):
Displayed 15 items.
- A note on the power of majority gates and modular gates (Q673905) (← links)
- Exponential lower bounds on the size of constant-depth threshold circuits with small energy complexity (Q955021) (← links)
- A lower bound for perceptrons and an oracle separation of the \(PP^{PH}\) hierarchy (Q1271610) (← links)
- Upper and lower bounds for some depth-3 circuit classes (Q1377575) (← links)
- On the power of circuits with gates of low \(L_{1}\) norms. (Q1389652) (← links)
- On relations between counting communication complexity classes (Q1880784) (← links)
- The correlation between parity and quadratic polynomials mod \(3\) (Q1881261) (← links)
- \(n^{{\Omega{}}(\log{} n)}\) lower bounds on the size of depth-3 threshold circuits with AND gates at the bottom (Q2365817) (← links)
- Depth Reduction for Circuits with a Single Layer of Modular Counting Gates (Q3392947) (← links)
- On the Non-deterministic Communication Complexity of Regular Languages (Q3533002) (← links)
- Deep Belief Networks Are Compact Universal Approximators (Q3583502) (← links)
- ON THE NON-DETERMINISTIC COMMUNICATION COMPLEXITY OF REGULAR LANGUAGES (Q3586400) (← links)
- Quantum multiparty communication complexity and circuit lower bounds (Q3616221) (← links)
- A lower bound for monotone perceptrons (Q4841765) (← links)
- Noise sensitivity of Boolean functions and applications to percolation (Q5932371) (← links)