Login / Signup
The error bounds and tractability of quasi-Monte Carlo algorithms in infinite dimension.
Fred J. Hickernell
Xiaoqun Wang
Published in:
Math. Comput. (2002)
Keyphrases
</>
error bounds
theoretical analysis
worst case
computational complexity
learning algorithm
constraint satisfaction
feature space
lower bound
computationally expensive