On the complexity of computing the \(L_q\) norm
type: Item
instance of: scholarly article
title: On the complexity of computing the \(L_q\) norm
zbMATH Open document ID: 1415.65033
author: Stefan Heinrich
published in: Journal of Complexity
publication date: 2018-10-11T00:00:00Z
Mathematics Subject Classification ID: 65D15
Mathematics Subject Classification ID: 65Y20
Mathematics Subject Classification ID: 68W20
zbMATH DE Number: 6951539
zbMATH Keywords: complexity
zbMATH Keywords: norm computation
zbMATH Keywords: deterministic and randomized algorithm
zbMATH Keywords: approximation
MaRDI profile type: Publication
full work available at URL: j.jco.2018.07.001
OpenAlex ID: W2862910548
cites work: Q4073917
cites work: Q4162607
cites work: Q3160669
cites work: Monte Carlo approximation of weakly singular integral operators
cites work: The randomized information complexity of elliptic PDE
cites work: Q3504242
cites work: Randomized approximation of Sobolev embeddings. II
cites work: Randomized approximation of Sobolev embeddings. III
cites work: The randomized complexity of indefinite integration
cites work: Deterministic and stochastic error bounds in numerical analysis
cites work: The real number model in numerical analysis
cites work: Function spaces in Lipschitz domains and optimal rates of convergence for sampling
cites work: Tractability of multivariate problems. Volume I: Linear information
cites work: Q4040428
cites work: Some nonlinear problems are as easy as the approximation problem
cites work: Q3639873
DOI: 10.1016/J.JCO.2018.07.001
description: scientific article; zbMATH DE number 6951539