Some open problems concerning the star-discrepancy

Authors:
Stefan Heinrich
Affiliations:
FB Informatik, Universität Kaiserslautern, Postfach 3049, D-67653 Kaiserslautern, Germany
Venue:
Journal of Complexity
Year:
2003

Citing 3
Cited 7

Random number generation and quasi-Monte Carlo methods

Random number generation and quasi-Monte Carlo methods
The exponent of discrepancy is at least 1.0669

Journal of Complexity
Open problems for tractability of multivariate integration

Journal of Complexity

Open problems for tractability of multivariate integration

Journal of Complexity
Covering numbers, vapnik-červonenkis classes and bounds for the star-discrepancy

Journal of Complexity
Bounds and constructions for the star-discrepancy via δ-covers

Journal of Complexity
Note: A note on the existence of sequences with small star discrepancy

Journal of Complexity
Tractability properties of the weighted star discrepancy

Journal of Complexity
Bounds and constructions for the star-discrepancy via δ-covers

Journal of Complexity
A New Randomized Algorithm to Approximate the Star Discrepancy Based on Threshold Accepting

SIAM Journal on Numerical Analysis

Quantified Score

Hi-index	0.00

Visualization

Abstract

We discuss open problems on the minimal star-discrepancy of an n-point set in the d-dimensional unit cube [0, 1]d. We emphasize the aspect of dimension dependence and of simultaneous dependence on n and d.