Pages that link to "Item:Q4308779"
From MaRDI portal
The following pages link to Rational approximation techniques for analysis of neural networks (Q4308779):
Displayed 13 items.
- A small decrease in the degree of a polynomial with a given sign function can exponentially increase its weight and length (Q368235) (← links)
- Energy and depth of threshold circuits (Q410715) (← links)
- Size-energy tradeoffs for unate circuits computing symmetric Boolean functions (Q627177) (← links)
- A size-depth trade-off for the analog computation of Boolean functions (Q671617) (← links)
- Negative results for approximation using single layer and multilayer feedforward neural networks (Q2226355) (← links)
- Size and Energy of Threshold Circuits Computing Mod Functions (Q3182969) (← links)
- Breaking the Minsky--Papert Barrier for Constant-Depth Circuits (Q4554070) (← links)
- The Power of Asymmetry in Constant-Depth Circuits (Q4562278) (← links)
- Average-Case Lower Bounds and Satisfiability Algorithms for Small Threshold Circuits (Q4568115) (← links)
- General-Purpose Computation with Neural Networks: A Survey of Complexity Theoretic Results (Q4819851) (← links)
- Near-Optimal Lower Bounds on the Threshold Degree and Sign-Rank of AC$^0$ (Q4957911) (← links)
- Algorithmic Polynomials (Q5138783) (← links)
- Optimal bounds for sign-representing the intersection of two halfspaces by polynomials (Q5891428) (← links)