Towards a constructive version of Banaszczyk's vector balancing theorem

DOI10.4086/TOC.2019.V015A015MaRDI QIDQ5215661zbMATH OpenOpenAlexFDO

Authors Daniel Dadush, Shashwat Garg, Shachar Lovett, Aleksandar Nikolov

Publication date 12 February 2020

Published in Theory of Computing (Search for Journal in Brave)

Copyright license Creative Commons Attribution 4.0 International

Full work available at URL https://doi.org/10.4086/toc.2019.v015a015

zbMATH Keywords

convex geometrydiscrepancyvector balancing

Mathematics Subject Classification ID

Convex sets in (n) dimensions (including convex hypersurfaces) (52A20) Computational aspects related to convexity (52B55) Lattices and convex bodies in (n) dimensions (aspects of discrete geometry) (52C07)

Recommendations

• Towards a constructive version of Banaszczyk's vector balancing theorem
• The Gram-Schmidt walk: a cure for the Banaszczyk blues
• The Gram-Schmidt walk: a cure for the Banaszczyk blues
• On some vector balancing problems
• scientific article; zbMATH DE number 1380581

Cited in

(6)

• Gaussian discrepancy: a probabilistic relaxation of vector balancing
• On some vector balancing problems
• Towards a constructive version of Banaszczyk's vector balancing theorem
• The Gram-Schmidt walk: a cure for the Banaszczyk blues
• Vector balancing in Lebesgue spaces
• The Discrepancy of Unsatisfiable Matrices and a Lower Bound for the Komlós Conjecture Constant

This page was built for publication: Towards a constructive version of Banaszczyk's vector balancing theorem

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q5215661)