The following pages link to (Q3504230):
Displayed 10 items.
- Algorithmic construction of low-discrepancy point sets via dependent randomized rounding (Q708312) (← links)
- Finding optimal volume subintervals with \( k\) points and calculating the star discrepancy are NP-hard problems (Q1023397) (← links)
- Discrepancy bounds for a class of negatively dependent random points including Latin hypercube samples (Q2240873) (← links)
- On probabilistic results for the discrepancy of a hybrid-Monte Carlo sequence (Q2272146) (← links)
- Bracketing numbers for axis-parallel boxes and applications to geometric discrepancy (Q2483204) (← links)
- Randomized Rounding in the Presence of a Cardinality Constraint (Q2828177) (← links)
- The Inverse of the Star-Discrepancy Problem and the Generation of Pseudo-Random Numbers (Q2945082) (← links)
- Some Results on the Complexity of Numerical Integration (Q2957029) (← links)
- Discrepancy Theory and Quasi-Monte Carlo Integration (Q5264199) (← links)
- Calculation of Discrepancy Measures and Applications (Q5264200) (← links)