Pages that link to "Item:Q2505651"
From MaRDI portal
The following pages link to Polynomial-time algorithms for multivariate linear problems with finite-order weights: worst case setting (Q2505651):
Displaying 10 items.
- Tractability of multivariate approximation over a weighted unanchored Sobolev space (Q843721) (← links)
- Tractability of quasilinear problems. I: General results (Q880024) (← links)
- Polynomial-time algorithms for multivariate linear problems with finite-order weights: Average case setting (Q1029550) (← links)
- Explicit cost bounds of algorithms for multivariate tensor product problems (Q1346592) (← links)
- Finite-order weights imply tractability of linear multivariate problems (Q1881675) (← links)
- On weak tractability of the Clenshaw-Curtis Smolyak algorithm (Q2451171) (← links)
- Periodization strategy may fail in high dimensions (Q2471079) (← links)
- Smolyak's algorithm for weighted \(L_1\)-approximation of multivariate functions with bounded \(r\)th mixed derivatives over \(\mathbb R^d\) (Q2583235) (← links)
- Polynomial-time data reduction for weighted problems beyond additive goal functions (Q2685700) (← links)
- On decompositions of multivariate functions (Q3584811) (← links)
