Pages that link to "Item:Q708312"
From MaRDI portal
The following pages link to Algorithmic construction of low-discrepancy point sets via dependent randomized rounding (Q708312):
Displaying 14 items.
- Hardness of discrepancy computation and \(\varepsilon\)-net verification in high dimension (Q413466) (← links)
- Secure pseudorandom bit generators and point sets with low star-discrepancy (Q2029676) (← links)
- Deterministic constructions of high-dimensional sets with small dispersion (Q2149098) (← links)
- Discrepancy bounds for a class of negatively dependent random points including Latin hypercube samples (Q2240873) (← links)
- Tractability results for the weighted star-discrepancy (Q2251911) (← links)
- Numerical integration of Hölder continuous, absolutely convergent Fourier, Fourier cosine, and Walsh series (Q2451170) (← links)
- Infinite-dimensional integration on weighted Hilbert spaces (Q2840006) (← links)
- A New Randomized Algorithm to Approximate the Star Discrepancy Based on Threshold Accepting (Q2903013) (← 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)
- A generalized Faulhaber inequality, improved bracketing covers, and applications to discrepancy (Q4956929) (← links)
- Calculation of Discrepancy Measures and Applications (Q5264200) (← links)
- Entropy, Randomization, Derandomization, and Discrepancy (Q5326100) (← links)
- Probabilistic discrepancy bound for Monte Carlo point sets (Q5401705) (← links)
