On the discrepancy of low-dimensional probability measures
From MaRDI portal
Recommendations
- A method for exact calculation of the discrepancy of low-dimensional finite point sets (II)
- Finding optimal volume subintervals with \( k\) points and calculating the star discrepancy are NP-hard problems
- Low-discrepancy point sets for non-uniform measures
- Calculation of discrepancy measures and applications
- A method for exact calculation of the discrepancy of low-dimensional finite point sets. I
Cites work
- A method for exact calculation of the discrepancy of low-dimensional finite point sets (II)
- A method for exact calculation of the discrepancy of low-dimensional finite point sets. I
- A method for exact calculation of the stardiscrepancy of plane sets applied to the sequences of Hammersley
- An algorithm to compute bounds for the star discrepancy
- Application of Threshold-Accepting to the Evaluation of the Discrepancy of a Set of Points
- Bracketing numbers for axis-parallel boxes and applications to geometric discrepancy
- Calculation of the discrepancy of a finite set of points in the unit n -cube
- Computing bounds for the star discrepancy
- Discrepancy and convex programming
- Families of well approximable measures
- Finding optimal volume subintervals with \( k\) points and calculating the star discrepancy are NP-hard problems
- Hardness of discrepancy computation and \(\varepsilon\)-net verification in high dimension
- scientific article; zbMATH DE number 53679 (Why is no real title available?)
- scientific article; zbMATH DE number 3440485 (Why is no real title available?)
- scientific article; zbMATH DE number 3392565 (Why is no real title available?)
This page was built for publication: On the discrepancy of low-dimensional probability measures
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q6633978)
