| Article ID | Journal | Published Year | Pages | File Type |
|---|---|---|---|---|
| 9501386 | Journal of Complexity | 2005 | 19 Pages |
Abstract
We give an explicit construction of low-discrepancy points with a derandomized algorithm. The running time of the algorithm, which is exponentially in d, is discussed in detail and comparisons with other methods are given.
Related Topics
Physical Sciences and Engineering
Mathematics
Analysis
Authors
Benjamin Doerr, Michael Gnewuch, Anand Srivastav,