{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,11,18]],"date-time":"2025-11-18T09:52:40Z","timestamp":1763459560633,"version":"3.45.0"},"publisher-location":"New York, NY, USA","reference-count":24,"publisher":"ACM","license":[{"start":{"date-parts":[[2017,1,14]],"date-time":"2017-01-14T00:00:00Z","timestamp":1484352000000},"content-version":"vor","delay-in-days":366,"URL":"http:\/\/www.acm.org\/publications\/policies\/copyright_policy#Background"}],"funder":[{"DOI":"10.13039\/100000001","name":"National Science Foundation","doi-asserted-by":"publisher","award":["CNS-1523467,CCF-1412958,CCF-1320188"],"award-info":[{"award-number":["CNS-1523467,CCF-1412958,CCF-1320188"]}],"id":[{"id":"10.13039\/100000001","id-type":"DOI","asserted-by":"publisher"}]}],"content-domain":{"domain":["dl.acm.org"],"crossmark-restriction":true},"short-container-title":[],"published-print":{"date-parts":[[2016,1,14]]},"DOI":"10.1145\/2840728.2840750","type":"proceedings-article","created":{"date-parts":[[2016,1,5]],"date-time":"2016-01-05T09:26:11Z","timestamp":1451985971000},"page":"293-300","update-policy":"https:\/\/doi.org\/10.1145\/crossmark-policy","source":"Crossref","is-referenced-by-count":2,"title":["On the Space Complexity of Linear Programming with Preprocessing"],"prefix":"10.1145","author":[{"given":"Yael","family":"Tauman Kalai","sequence":"first","affiliation":[{"name":"Microsoft Research, Cambridge, MA, USA"}],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Ran","family":"Raz","sequence":"additional","affiliation":[{"name":"Weizmann Institute of Science & The Institute for Advanced Study, Princeton, NJ, USA"}],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Oded","family":"Regev","sequence":"additional","affiliation":[{"name":"New York University, New York, NY, USA"}],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"320","published-online":{"date-parts":[[2016,1,14]]},"reference":[{"key":"e_1_3_2_1_1_1","doi-asserted-by":"publisher","DOI":"10.5555\/1540612"},{"key":"e_1_3_2_1_2_1","doi-asserted-by":"publisher","DOI":"10.1088\/0305-4470\/39\/36\/010"},{"key":"e_1_3_2_1_3_1","doi-asserted-by":"publisher","DOI":"10.1109\/FSCS.1990.89520"},{"key":"e_1_3_2_1_4_1","doi-asserted-by":"publisher","DOI":"10.1103\/PhysRevA.71.022101"},{"key":"e_1_3_2_1_5_1","doi-asserted-by":"publisher","DOI":"10.1145\/62212.62223"},{"key":"e_1_3_2_1_6_1","doi-asserted-by":"publisher","DOI":"10.1145\/1008731.1008733"},{"key":"e_1_3_2_1_7_1","first-page":"339","volume-title":"Maximization of linear function of variables subject to linear inequalities","author":"Dantzig G. B.","year":"1951","unstructured":"G. B. Dantzig. Maximization of linear function of variables subject to linear inequalities. pages 339--347, 1951."},{"key":"e_1_3_2_1_8_1","doi-asserted-by":"publisher","DOI":"10.1016\/0020-0190(79)90152-2"},{"key":"e_1_3_2_1_9_1","doi-asserted-by":"publisher","DOI":"10.1145\/1007352.1007404"},{"key":"e_1_3_2_1_10_1","doi-asserted-by":"publisher","DOI":"10.1145\/258533.258644"},{"key":"e_1_3_2_1_11_1","doi-asserted-by":"publisher","DOI":"10.4086\/toc.2009.v005a008"},{"key":"e_1_3_2_1_12_1","doi-asserted-by":"publisher","DOI":"10.5555\/1880918.1880935"},{"key":"e_1_3_2_1_13_1","doi-asserted-by":"publisher","DOI":"10.1109\/CCC.2009.22"},{"key":"e_1_3_2_1_14_1","doi-asserted-by":"publisher","DOI":"10.1145\/2591796.2591809"},{"key":"e_1_3_2_1_15_1","doi-asserted-by":"publisher","DOI":"10.1007\/BF02579150"},{"key":"e_1_3_2_1_16_1","doi-asserted-by":"publisher","DOI":"10.1145\/1132516.1132524"},{"key":"e_1_3_2_1_17_1","doi-asserted-by":"publisher","DOI":"10.1109\/FOCS.2008.8"},{"key":"e_1_3_2_1_18_1","first-page":"1093","volume-title":"Doklady Akademia Nauk SSSR","author":"Khachiyan L. G.","year":"1979","unstructured":"L. G. Khachiyan. A polynomial algorithm in linear programming. In Doklady Akademia Nauk SSSR, pages 1093--1096, 1979."},{"key":"e_1_3_2_1_19_1","first-page":"441","volume-title":"In Symposium on the Foundations of Modern Physics","author":"Khalfin L. A.","year":"1985","unstructured":"L. A. Khalfin and B. S. Tsirelson. Quantum and quasi-classical analogs of Bell inequalities. In In Symposium on the Foundations of Modern Physics, pages 441--460, 1985."},{"key":"e_1_3_2_1_20_1","doi-asserted-by":"publisher","DOI":"10.1145\/167088.167211"},{"key":"e_1_3_2_1_21_1","doi-asserted-by":"publisher","DOI":"10.1007\/BF02058098"},{"key":"e_1_3_2_1_22_1","doi-asserted-by":"publisher","DOI":"10.1007\/BF00739036"},{"key":"e_1_3_2_1_23_1","doi-asserted-by":"publisher","DOI":"10.1016\/0020-0190(91)90194-M"},{"key":"e_1_3_2_1_24_1","doi-asserted-by":"publisher","DOI":"10.1098\/rspa.2008.0149"}],"event":{"name":"ITCS'16: Innovations in Theoretical Computer Science","sponsor":["SIGACT ACM Special Interest Group on Algorithms and Computation Theory"],"location":"Cambridge Massachusetts USA","acronym":"ITCS'16"},"container-title":["Proceedings of the 2016 ACM Conference on Innovations in Theoretical Computer Science"],"original-title":[],"link":[{"URL":"https:\/\/dl.acm.org\/doi\/10.1145\/2840728.2840750","content-type":"unspecified","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/dl.acm.org\/doi\/pdf\/10.1145\/2840728.2840750","content-type":"application\/pdf","content-version":"vor","intended-application":"syndication"},{"URL":"https:\/\/dl.acm.org\/doi\/pdf\/10.1145\/2840728.2840750","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2025,11,18]],"date-time":"2025-11-18T09:48:41Z","timestamp":1763459321000},"score":1,"resource":{"primary":{"URL":"https:\/\/dl.acm.org\/doi\/10.1145\/2840728.2840750"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2016,1,14]]},"references-count":24,"alternative-id":["10.1145\/2840728.2840750","10.1145\/2840728"],"URL":"https:\/\/doi.org\/10.1145\/2840728.2840750","relation":{},"subject":[],"published":{"date-parts":[[2016,1,14]]},"assertion":[{"value":"2016-01-14","order":3,"name":"published","label":"Published","group":{"name":"publication_history","label":"Publication History"}}]}}