Pages that link to "Item:Q1023397"
From MaRDI portal
The following pages link to Finding optimal volume subintervals with \( k\) points and calculating the star discrepancy are NP-hard problems (Q1023397):
Displayed 4 items.
- Hardness of discrepancy computation and \(\varepsilon\)-net verification in high dimension (Q413466) (← links)
- Consistency of Markov chain quasi-Monte Carlo on continuous state spaces (Q548531) (← links)
- Algorithmic construction of low-discrepancy point sets via dependent randomized rounding (Q708312) (← links)
- A genetic algorithm approach to estimate lower bounds of the star discrepancy (Q3068191) (← links)