A simplified criterion for quasi-polynomial tractability of approximation of random elements and its applications

From MaRDI portal
Publication:272187


DOI10.1016/j.jco.2015.11.004zbMath1416.65582arXiv1503.02600MaRDI QIDQ272187

A. A. Khartov

Publication date: 20 April 2016

Published in: Journal of Complexity (Search for Journal in Brave)

Full work available at URL: https://arxiv.org/abs/1503.02600


60G60: Random fields

68Q25: Analysis of algorithms and problem complexity

68W25: Approximation algorithms

65Y20: Complexity and performance of numerical algorithms

60B11: Probability theory on linear topological spaces


Related Items



Cites Work