Pages that link to "Item:Q1791678"
From MaRDI portal
The following pages link to On the complexity of computing the \(L_q\) norm (Q1791678):
Displaying 8 items.
- How many vectors are needed to compute \((p,q)\)-summing norms (Q1913500) (← links)
- Algorithms and complexity for functions on general domains (Q1996873) (← links)
- Solvable integration problems and optimal sample size selection (Q2001207) (← links)
- Sampling discretization and related problems (Q2136857) (← links)
- Sampling discretization error of integral norms for function classes (Q2274411) (← links)
- Computing the norm ∥<i>A</i>∥∞,1 is NP-hard<sup>∗</sup> (Q4498326) (← links)
- Randomized complexity of parametric integration and the role of adaption. I: Finite dimensional case (Q6154554) (← links)
- Randomized complexity of mean computation and the adaption problem (Q6614418) (← links)