Pages that link to "Item:Q413466"
From MaRDI portal
The following pages link to Hardness of discrepancy computation and \(\varepsilon\)-net verification in high dimension (Q413466):
Displaying 5 items.
- On the number of maximum empty boxes amidst \(n\) points (Q1745207) (← links)
- Star discrepancy subset selection: problem formulation and efficient approaches for low dimensions (Q2121499) (← links)
- An enumerative formula for the spherical cap discrepancy (Q2226329) (← links)
- Discrepancy bounds for a class of negatively dependent random points including Latin hypercube samples (Q2240873) (← links)
- Faster algorithms for largest empty rectangles and boxes (Q6174805) (← links)
