Pages that link to "Item:Q5946400"
From MaRDI portal
The following pages link to Complexity of neural network approximation with limited information: A worst case approach (Q5946400):
Displaying 4 items.
- Some comparisons of complexity in dictionary-based and linear computational models (Q553254) (← links)
- Information-based nonlinear approximation: an average case setting (Q1772685) (← links)
- A lower bound on the competitivity of memoryless algorithms for a generalization of the CNN problem (Q2503284) (← links)
- On Linear Versus Nonlinear Approximation in the Average Case Setting (Q4611839) (← links)
