Pages that link to "Item:Q4908259"
From MaRDI portal
The following pages link to The determinant bound for discrepancy is almost tight (Q4908259):
Displaying 16 items.
- Unsplittable coverings in the plane (Q317324) (← links)
- A note on the discrepancy of matrices with bounded row and column sums (Q488272) (← links)
- Semidefinite optimization in discrepancy theory (Q715251) (← links)
- Deterministic discrepancy minimization (Q2017871) (← links)
- Quantum discrepancy: a non-commutative version of combinatorial discrepancy (Q2185209) (← links)
- Linear and hereditary discrepancy (Q2703023) (← links)
- The geometry of differential privacy: the small database and approximate cases (Q2805515) (← links)
- Minimum and maximum order of magnitude of the discrepancy of (nα) (Q4324626) (← links)
- A simplified disproof of Beck’s three permutations conjecture and an application to root-mean-squared discrepancy (Q4993131) (← links)
- Factorization Norms and Hereditary Discrepancy (Q5217269) (← links)
- Algorithmic Aspects of Combinatorial Discrepancy (Q5264196) (← links)
- A trace bound for the hereditary discrepancy (Q5946380) (← links)
- (Q6084421) (← links)
- Discrepancy theory and related algorithms (Q6200209) (← links)
- On the gap between hereditary discrepancy and the determinant lower bound (Q6490279) (← links)
- Faster algorithms for sparse ILP and hypergraph multi-packing/multi-cover problems (Q6593834) (← links)
