{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,6,10]],"date-time":"2026-06-10T07:48:57Z","timestamp":1781077737466,"version":"3.54.1"},"publisher-location":"New York, NY, USA","reference-count":16,"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:\/\/www.acm.org\/publications\/policies\/copyright_policy#Background"}],"content-domain":{"domain":["dl.acm.org"],"crossmark-restriction":true},"short-container-title":[],"published-print":{"date-parts":[[2022,6,9]]},"DOI":"10.1145\/3519935.3519983","type":"proceedings-article","created":{"date-parts":[[2022,6,10]],"date-time":"2022-06-10T15:29:32Z","timestamp":1654874972000},"page":"275-288","update-policy":"https:\/\/doi.org\/10.1145\/crossmark-policy","source":"Crossref","is-referenced-by-count":9,"title":["Linear space streaming lower bounds for approximating CSPs"],"prefix":"10.1145","author":[{"given":"Chi-Ning","family":"Chou","sequence":"first","affiliation":[{"name":"Harvard University, USA"}],"role":[{"vocabulary":"crossref","role":"author"}]},{"given":"Alexander","family":"Golovnev","sequence":"additional","affiliation":[{"name":"Georgetown University, USA"}],"role":[{"vocabulary":"crossref","role":"author"}]},{"given":"Madhu","family":"Sudan","sequence":"additional","affiliation":[{"name":"Harvard University, USA"}],"role":[{"vocabulary":"crossref","role":"author"}]},{"given":"Ameya","family":"Velingker","sequence":"additional","affiliation":[{"name":"Google Research, USA"}],"role":[{"vocabulary":"crossref","role":"author"}]},{"given":"Santhoshini","family":"Velusamy","sequence":"additional","affiliation":[{"name":"Harvard University, USA"}],"role":[{"vocabulary":"crossref","role":"author"}]}],"member":"320","published-online":{"date-parts":[[2022,6,10]]},"reference":[{"key":"e_1_3_2_1_1_1","doi-asserted-by":"publisher","DOI":"10.1145\/2897518.2897576"},{"key":"e_1_3_2_1_2_1","doi-asserted-by":"publisher","DOI":"10.1109\/FOCS46700.2020.00041"},{"key":"e_1_3_2_1_3_1","doi-asserted-by":"publisher","DOI":"10.1145\/3406325.3451110"},{"key":"e_1_3_2_1_4_1","doi-asserted-by":"publisher","DOI":"10.1109\/FOCS52979.2021.00117"},{"key":"e_1_3_2_1_5_1","volume-title":"Approximability of all Boolean CSPs with linear sketches. CoRR, abs\/2102.12351v3","author":"Chou Chi-Ning","year":"2021","unstructured":"Chi-Ning Chou , Alexander Golovnev , Madhu Sudan , and Santhoshini Velusamy . 2021. Approximability of all Boolean CSPs with linear sketches. CoRR, abs\/2102.12351v3 ( 2021 ), 14th April, arxiv:2102.12351. arxiv:2102.12351v3 Chi-Ning Chou, Alexander Golovnev, Madhu Sudan, and Santhoshini Velusamy. 2021. Approximability of all Boolean CSPs with linear sketches. CoRR, abs\/2102.12351v3 (2021), 14th April, arxiv:2102.12351. arxiv:2102.12351v3"},{"key":"e_1_3_2_1_6_1","doi-asserted-by":"crossref","unstructured":"Chi-Ning Chou Alexander Golovnev Madhu Sudan Ameya Velingker and Santhoshini Velusamy. 2021. Linear Space Streaming Lower Bounds for Approximating CSPs. June arxiv:2106.13078.  Chi-Ning Chou Alexander Golovnev Madhu Sudan Ameya Velingker and Santhoshini Velusamy. 2021. Linear Space Streaming Lower Bounds for Approximating CSPs. June arxiv:2106.13078.","DOI":"10.1145\/3519935.3519983"},{"key":"e_1_3_2_1_7_1","doi-asserted-by":"publisher","DOI":"10.1109\/FOCS46700.2020.00039"},{"key":"e_1_3_2_1_8_1","doi-asserted-by":"publisher","DOI":"10.1137\/070706550"},{"key":"e_1_3_2_1_9_1","doi-asserted-by":"publisher","DOI":"10.4230\/LIPIcs.APPROX-RANDOM.2019.5"},{"key":"e_1_3_2_1_10_1","doi-asserted-by":"publisher","DOI":"10.4230\/LIPIcs.APPROX-RANDOM.2017.8"},{"key":"e_1_3_2_1_11_1","doi-asserted-by":"publisher","DOI":"10.1137\/1.9781611973730.84"},{"key":"e_1_3_2_1_12_1","doi-asserted-by":"publisher","DOI":"10.1137\/1.9781611974782.112"},{"key":"e_1_3_2_1_13_1","doi-asserted-by":"publisher","DOI":"10.1145\/3313276.3316364"},{"key":"e_1_3_2_1_14_1","volume-title":"Analysis of Boolean functions","author":"O\u2019Donnell Ryan","unstructured":"Ryan O\u2019Donnell . 2014. Analysis of Boolean functions . Cambridge University Press . Ryan O\u2019Donnell. 2014. Analysis of Boolean functions. Cambridge University Press."},{"key":"e_1_3_2_1_15_1","doi-asserted-by":"publisher","DOI":"10.4230\/LIPIcs.APPROX\/RANDOM.2021.17"},{"key":"e_1_3_2_1_16_1","doi-asserted-by":"publisher","DOI":"10.1137\/1.9781611973082.2"}],"event":{"name":"STOC '22: 54th Annual ACM SIGACT Symposium on Theory of Computing","location":"Rome Italy","acronym":"STOC '22","sponsor":["SIGACT ACM Special Interest Group on Algorithms and Computation Theory"]},"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.3519983","content-type":"unspecified","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/dl.acm.org\/doi\/pdf\/10.1145\/3519935.3519983","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2025,6,18]],"date-time":"2025-06-18T17:49:39Z","timestamp":1750268979000},"score":1,"resource":{"primary":{"URL":"https:\/\/dl.acm.org\/doi\/10.1145\/3519935.3519983"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2022,6,9]]},"references-count":16,"alternative-id":["10.1145\/3519935.3519983","10.1145\/3519935"],"URL":"https:\/\/doi.org\/10.1145\/3519935.3519983","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"}}]}}