Factorization Norms and Hereditary Discrepancy
From MaRDI portal
Publication:5217269
DOI10.1093/imrn/rny033zbMath1459.11161arXiv1408.1376OpenAlexW2964024102MaRDI QIDQ5217269
Aleksandar Nikolov, Kunal Talwar, Ji{ří} Matoušek
Publication date: 24 February 2020
Published in: International Mathematics Research Notices (Search for Journal in Brave)
Full work available at URL: https://arxiv.org/abs/1408.1376
Related Items (10)
Near-optimal coresets of kernel density estimates ⋮ Discrepancy theory and related algorithms ⋮ TIGHTER BOUNDS FOR THE DISCREPANCY OF BOXES AND POLYTOPES ⋮ Unnamed Item ⋮ On the Computational Complexity of Linear Discrepancy ⋮ Linear discrepancy is \(\Pi_2\)-hard to approximate ⋮ Deterministic Tensor Completion with Hypergraph Expanders ⋮ Unnamed Item ⋮ Unnamed Item ⋮ The Communication Complexity of Distributed epsilon-Approximations
This page was built for publication: Factorization Norms and Hereditary Discrepancy