Go to the corresponding LIPIcs Volume Portal 
Spielman, Daniel A. ; Zhang, Peng
pdfformat: 

@InProceedings{spielman_et_al:LIPIcs.APPROX/RANDOM.2022.40, author = {Spielman, Daniel A. and Zhang, Peng}, title = {{Hardness Results for Weaver’s Discrepancy Problem}}, booktitle = {Approximation, Randomization, and Combinatorial Optimization. Algorithms and Techniques (APPROX/RANDOM 2022)}, pages = {40:140:14}, series = {Leibniz International Proceedings in Informatics (LIPIcs)}, ISBN = {9783959772495}, ISSN = {18688969}, year = {2022}, volume = {245}, editor = {Chakrabarti, Amit and Swamy, Chaitanya}, publisher = {Schloss Dagstuhl  LeibnizZentrum f{\"u}r Informatik}, address = {Dagstuhl, Germany}, URL = {https://drops.dagstuhl.de/opus/volltexte/2022/17162}, URN = {urn:nbn:de:0030drops171628}, doi = {10.4230/LIPIcs.APPROX/RANDOM.2022.40}, annote = {Keywords: Discrepancy Problem, KadisonSinger Problem, Hardness of Approximation} }
Keywords:  Discrepancy Problem, KadisonSinger Problem, Hardness of Approximation  
Collection:  Approximation, Randomization, and Combinatorial Optimization. Algorithms and Techniques (APPROX/RANDOM 2022)  
Issue Date:  2022  
Date of publication:  15.09.2022 