Pages that link to "Item:Q2365416"

The following pages link to Worst case complexity of problems with random information noise (Q2365416):

Displaying 10 items.

• On the optimal robust solution of IVPs with noisy information (Q261847) (← links)
• The complexity of Fredholm equations of the second kind: noisy information about everything (Q610938) (← links)
• Average case \(L_\infty\)-approximation in the presence of Gaussian noise (Q1266109) (← links)
• The complexity of indefinite elliptic problems with noisy data (Q1383441) (← links)
• Where does smoothness count the most for Fredholm equations of the second kind with noisy information? (Q1887113) (← links)
• Complexity of approximating Hölder classes from information with varying Gaussian noise (Q2192676) (← links)
• The worst case complexity of the fredholm equation of the second kind with non-periodic free term and noise information (Q4400144) (← links)
• The worst case complexity of the fredholm equation with periodic free term and noisy information^∗ (Q4935386) (← links)
• Complexity of neural network approximation with limited information: A worst case approach (Q5946400) (← links)
• Worst case tractability of linear problems in the presence of noise: linear information (Q6062169) (← links)