The following pages link to (Q5692699):
Displaying 14 items.
- On the optimal order of worst case complexity of direct search (Q276315) (← links)
- Uniform convergence rates for halfspace depth (Q512790) (← links)
- Covering compact metric spaces greedily (Q722361) (← links)
- Chromatic numbers of spheres (Q1783626) (← links)
- Adaptive covariance matrix estimation through block thresholding (Q1940765) (← links)
- The Kneser-Poulsen conjecture for special contractions (Q1991405) (← links)
- Covering convex bodies and the closest vector problem (Q2136842) (← links)
- On the distance of polytopes with few vertices to the Euclidean ball (Q2256588) (← links)
- Covering a ball by smaller balls (Q2334501) (← links)
- A concentration inequality for random polytopes, Dirichlet-Voronoi tiling numbers and the geometric balls and bins problem (Q2664110) (← links)
- On some covering problems in geometry (Q2809209) (← links)
- Cayley graphs that have a quantum ergodic eigenbasis (Q6074041) (← links)
- A uniform lower bound on the norms of hyperplane projections of spherical polytopes (Q6156097) (← links)
- Approximating Tensor Norms via Sphere Covering: Bridging the Gap between Primal and Dual (Q6176424) (← links)
