The determinant bound for discrepancy is almost tight
From MaRDI portal
Publication:4908259
DOI10.1090/S0002-9939-2012-11334-6zbMath1259.05179arXiv1101.0767OpenAlexW1981295892MaRDI QIDQ4908259
Publication date: 5 March 2013
Published in: Proceedings of the American Mathematical Society (Search for Journal in Brave)
Full work available at URL: https://arxiv.org/abs/1101.0767
Related Items (7)
Unsplittable coverings in the plane ⋮ Discrepancy theory and related algorithms ⋮ Unnamed Item ⋮ Deterministic discrepancy minimization ⋮ The Geometry of Differential Privacy: The Small Database and Approximate Cases ⋮ A simplified disproof of Beck’s three permutations conjecture and an application to root-mean-squared discrepancy ⋮ Algorithmic Aspects of Combinatorial Discrepancy
Cites Work
This page was built for publication: The determinant bound for discrepancy is almost tight