Pages that link to "Item:Q757053"

The following pages link to Probabilistic complexity analysis for linear problems in bounded domains (Q757053):

Displaying 13 items.

• Probability estimates for reachability of linear systems defined over finite fields (Q259269) (← links)
• s-numbers in information-based complexity (Q757049) (← links)
• Probabilistic analysis of numerical methods for integral equations (Q808674) (← links)
• Probabilistic setting of information-based complexity (Q1092660) (← links)
• Corrections to ''Probabilistic analysis of numerical methods for integral equations'' (Q1182522) (← links)
• Lower bounds for the complexity of Monte Carlo function approximation (Q1201159) (← links)
• Average approximations and moments of measures (Q1578425) (← links)
• The average case complexity of the Fredholm equation of second kind with free term in \(H^ r(\Gamma)\) (Q1917153) (← links)
• Algorithms and complexity for functions on general domains (Q1996873) (← links)
• Embeddings for infinite-dimensional integration and \(L_2\)-approximation with increasing smoothness (Q2274409) (← links)
• A linear-time algorithm for computing the multinomial stochastic complexity (Q2379977) (← links)
• (Q3686042) (← links)
• The worst case complexity of the fredholm equation with periodic free term and noisy information^∗ (Q4935386) (← links)