{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,11,19]],"date-time":"2025-11-19T09:38:42Z","timestamp":1763545122576,"version":"3.41.0"},"publisher-location":"New York, NY, USA","reference-count":35,"publisher":"ACM","license":[{"start":{"date-parts":[[2022,6,9]],"date-time":"2022-06-09T00:00:00Z","timestamp":1654732800000},"content-version":"vor","delay-in-days":0,"URL":"https:\/\/creativecommons.org\/licenses\/by-nc\/4.0\/"}],"content-domain":{"domain":["dl.acm.org"],"crossmark-restriction":true},"short-container-title":[],"published-print":{"date-parts":[[2022,6,9]]},"DOI":"10.1145\/3519935.3519954","type":"proceedings-article","created":{"date-parts":[[2022,6,10]],"date-time":"2022-06-10T15:29:32Z","timestamp":1654874972000},"page":"637-648","update-policy":"https:\/\/doi.org\/10.1145\/crossmark-policy","source":"Crossref","is-referenced-by-count":7,"title":["Matrix discrepancy from Quantum communication"],"prefix":"10.1145","author":[{"given":"Samuel B.","family":"Hopkins","sequence":"first","affiliation":[{"name":"Massachusetts Institute of Technology, USA"}]},{"given":"Prasad","family":"Raghavendra","sequence":"additional","affiliation":[{"name":"University of California at Berkeley, USA"}]},{"given":"Abhishek","family":"Shetty","sequence":"additional","affiliation":[{"name":"University of California at Berkeley, USA"}]}],"member":"320","published-online":{"date-parts":[[2022,6,10]]},"reference":[{"key":"e_1_3_2_1_1_1","doi-asserted-by":"publisher","DOI":"10.1109\/18.985947"},{"key":"e_1_3_2_1_2_1","doi-asserted-by":"publisher","DOI":"10.1145\/581771.581773"},{"key":"e_1_3_2_1_3_1","doi-asserted-by":"publisher","DOI":"10.5555\/294762.294765"},{"key":"e_1_3_2_1_4_1","doi-asserted-by":"publisher","DOI":"10.1109\/focs.2010.7"},{"key":"e_1_3_2_1_5_1","doi-asserted-by":"publisher","DOI":"10.1109\/focs.2010.7"},{"key":"e_1_3_2_1_6_1","doi-asserted-by":"publisher","DOI":"10.1137\/17m1126795"},{"key":"e_1_3_2_1_7_1","doi-asserted-by":"publisher","DOI":"10.1145\/3188745.3188850"},{"key":"e_1_3_2_1_8_1","doi-asserted-by":"publisher","DOI":"10.1007\/978-3-540-85221-6_1"},{"key":"e_1_3_2_1_9_1","doi-asserted-by":"publisher","DOI":"10.1007\/bf02574037"},{"key":"e_1_3_2_1_10_1","doi-asserted-by":"publisher","DOI":"10.1137\/090772873"},{"key":"e_1_3_2_1_11_1","doi-asserted-by":"publisher","DOI":"10.1017\/cbo9780511626371"},{"key":"e_1_3_2_1_12_1","doi-asserted-by":"publisher","DOI":"10.4086\/toc.2019.v015a015"},{"key":"e_1_3_2_1_13_1","volume-title":"Proceedings of the 54th Annual ACM SIGACT Symposium on Theory of Computing. ACM.","author":"Dadush Daniel","year":"2022","unstructured":"Daniel Dadush , Haotian Jiang , and Victor Reis . 2022 . A New Framework for Matrix Discrepancy: Partial Coloring Bounds via Mirror Descent . In Proceedings of the 54th Annual ACM SIGACT Symposium on Theory of Computing. ACM. Daniel Dadush, Haotian Jiang, and Victor Reis. 2022. A New Framework for Matrix Discrepancy: Partial Coloring Bounds via Mirror Descent. In Proceedings of the 54th Annual ACM SIGACT Symposium on Theory of Computing. ACM."},{"key":"e_1_3_2_1_14_1","doi-asserted-by":"publisher","DOI":"10.1002\/rsa.20763"},{"key":"e_1_3_2_1_15_1","unstructured":"Shashwat Garg. 2018. Algorithms for combinatorial discrepancy. Ph. D. Dissertation. Technische Universiteit Eindhoven.  Shashwat Garg. 2018. Algorithms for combinatorial discrepancy. Ph. D. Dissertation. Technische Universiteit Eindhoven."},{"key":"e_1_3_2_1_16_1","doi-asserted-by":"publisher","DOI":"10.4064\/sm-122-3-225-234"},{"key":"e_1_3_2_1_17_1","doi-asserted-by":"publisher","DOI":"10.1070\/sm1989v064n01abeh003295"},{"key":"e_1_3_2_1_18_1","doi-asserted-by":"publisher","DOI":"10.1109\/tit.2011.2104999"},{"key":"e_1_3_2_1_19_1","unstructured":"Aram Harrow. 2013. The church of the symmetric subspace. arXiv preprint arXiv:1308.6595.  Aram Harrow. 2013. The church of the symmetric subspace. arXiv preprint arXiv:1308.6595."},{"key":"e_1_3_2_1_20_1","doi-asserted-by":"publisher","DOI":"10.1007\/s000370050018"},{"key":"e_1_3_2_1_21_1","doi-asserted-by":"publisher","DOI":"10.1016\/j.aim.2020.107366"},{"key":"e_1_3_2_1_22_1","doi-asserted-by":"publisher","DOI":"10.1137\/130929400"},{"key":"e_1_3_2_1_23_1","doi-asserted-by":"publisher","DOI":"10.4007\/annals.2015.182.1.8"},{"key":"e_1_3_2_1_24_1","unstructured":"Jiri Matousek. 2009. Geometric discrepancy: An illustrated guide. 18 Springer Science and Business Media.  Jiri Matousek. 2009. Geometric discrepancy: An illustrated guide. 18 Springer Science and Business Media."},{"key":"e_1_3_2_1_25_1","unstructured":"Raghu Meka. 2014. Discrepancy and beating the union bound. https:\/\/windowsontheory.org\/2014\/02\/07\/discrepancy-and-beating-the-union-bound\/  Raghu Meka. 2014. Discrepancy and beating the union bound. https:\/\/windowsontheory.org\/2014\/02\/07\/discrepancy-and-beating-the-union-bound\/"},{"key":"e_1_3_2_1_26_1","doi-asserted-by":"publisher","DOI":"10.1109\/sffcs.1999.814608"},{"key":"e_1_3_2_1_27_1","doi-asserted-by":"publisher","DOI":"10.1287\/moor.23.2.339"},{"key":"e_1_3_2_1_28_1","doi-asserted-by":"publisher","DOI":"10.1017\/9781108671644"},{"key":"e_1_3_2_1_29_1","doi-asserted-by":"publisher","DOI":"10.1137\/1.9781611975994.143"},{"key":"e_1_3_2_1_30_1","doi-asserted-by":"publisher","DOI":"10.1109\/focs.2014.23"},{"key":"e_1_3_2_1_31_1","doi-asserted-by":"publisher","DOI":"10.1137\/141000282"},{"key":"e_1_3_2_1_32_1","doi-asserted-by":"publisher","DOI":"10.1090\/s0002-9947-1985-0784009-0"},{"key":"e_1_3_2_1_33_1","doi-asserted-by":"publisher","DOI":"10.1137\/080734029"},{"key":"e_1_3_2_1_34_1","doi-asserted-by":"publisher","DOI":"10.1103\/PhysRevLett.114.170502"},{"key":"e_1_3_2_1_35_1","doi-asserted-by":"crossref","unstructured":"Anastasios Zouzias. 2012. A matrix hyperbolic cosine algorithm and applications. In International Colloquium on Automata Languages and Programming. 846\u2013858.  Anastasios Zouzias. 2012. A matrix hyperbolic cosine algorithm and applications. In International Colloquium on Automata Languages and Programming. 846\u2013858.","DOI":"10.1007\/978-3-642-31594-7_71"}],"event":{"name":"STOC '22: 54th Annual ACM SIGACT Symposium on Theory of Computing","sponsor":["SIGACT ACM Special Interest Group on Algorithms and Computation Theory"],"location":"Rome Italy","acronym":"STOC '22"},"container-title":["Proceedings of the 54th Annual ACM SIGACT Symposium on Theory of Computing"],"original-title":[],"link":[{"URL":"https:\/\/dl.acm.org\/doi\/10.1145\/3519935.3519954","content-type":"unspecified","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/dl.acm.org\/doi\/pdf\/10.1145\/3519935.3519954","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2025,6,18]],"date-time":"2025-06-18T17:49:38Z","timestamp":1750268978000},"score":1,"resource":{"primary":{"URL":"https:\/\/dl.acm.org\/doi\/10.1145\/3519935.3519954"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2022,6,9]]},"references-count":35,"alternative-id":["10.1145\/3519935.3519954","10.1145\/3519935"],"URL":"https:\/\/doi.org\/10.1145\/3519935.3519954","relation":{},"subject":[],"published":{"date-parts":[[2022,6,9]]},"assertion":[{"value":"2022-06-10","order":2,"name":"published","label":"Published","group":{"name":"publication_history","label":"Publication History"}}]}}