Probabilistic setting of information-bas
β
H WoΕΊniakowski
π
Article
π
1986
π
Elsevier Science
π
English
β 746 KB
We study the probabilistic (E, b)-complexity for linear problems equipped with Gaussian measures. The probabilistic (E, S)-complexity, comp@'(e, 6), is understood as the minimal cost required to compute approximations with error at most e on a set of measure at least 1 -6. We find estimates of comp@