Pages that link to "Item:Q685717"
From MaRDI portal
The following pages link to On the power of small-depth threshold circuits (Q685717):
Displaying 18 items.
- A lower bound for monotone perceptrons (Q4841765) (← links)
- Simultaneous multiparty communication protocols for composed functions (Q5005112) (← links)
- (Q5009555) (← links)
- Larger Corner-Free Sets from Better NOF Exactly-$N$ Protocols (Q5028500) (← links)
- On small depth threshold circuits (Q5056127) (← links)
- (Q5077146) (← links)
- (Q5090432) (← links)
- Neural networks and complexity theory (Q5096819) (← links)
- (Q5121894) (← links)
- On Functions Computed on Trees (Q5214392) (← links)
- Communication Lower Bounds Using Directional Derivatives (Q5501937) (← links)
- (Q5875501) (← links)
- Sharp Bounds for the Number of Regions of Maxout Networks and Vertices of Minkowski Sums (Q5886829) (← links)
- On the relationship between energy complexity and other Boolean function measures (Q5918744) (← links)
- Noise sensitivity of Boolean functions and applications to percolation (Q5932371) (← links)
- Size, Depth and Energy of Threshold Circuits Computing Parity Function. (Q6065463) (← links)
- Globally Convergent Multilevel Training of Deep Residual Networks (Q6108152) (← links)
- Circuit complexity before the dawn of the new millennium (Q6567750) (← links)