A note on E. Thiémard's algorithm to compute bounds for the star discrepancy
From MaRDI portal
Publication:558008
DOI10.1016/j.jco.2004.05.004zbMath1076.65005OpenAlexW2027979617WikidataQ57778937 ScholiaQ57778937MaRDI QIDQ558008
Publication date: 30 June 2005
Published in: Journal of Complexity (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1016/j.jco.2004.05.004
Related Items (5)
Good permutations for deterministic scrambled Halton sequences in terms of \(L_2\)-discrepancy ⋮ A genetic algorithm approach to estimate lower bounds of the star discrepancy ⋮ Finding optimal volume subintervals with \( k\) points and calculating the star discrepancy are NP-hard problems ⋮ A computational investigation of the optimal Halton sequence in QMC applications ⋮ Calculation of Discrepancy Measures and Applications
Cites Work
This page was built for publication: A note on E. Thiémard's algorithm to compute bounds for the star discrepancy