{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,6,23]],"date-time":"2025-06-23T16:04:53Z","timestamp":1750694693155,"version":"3.41.0"},"publisher-location":"New York, NY, USA","reference-count":22,"publisher":"ACM","license":[{"start":{"date-parts":[[2009,5,31]],"date-time":"2009-05-31T00:00:00Z","timestamp":1243728000000},"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":[[2009,5,31]]},"DOI":"10.1145\/1536414.1536458","type":"proceedings-article","created":{"date-parts":[[2009,6,2]],"date-time":"2009-06-02T14:51:13Z","timestamp":1243954273000},"page":"313-322","update-policy":"https:\/\/doi.org\/10.1145\/crossmark-policy","source":"Crossref","is-referenced-by-count":14,"title":["Linear time approximation schemes for the Gale-Berlekamp game and related minimization problems"],"prefix":"10.1145","author":[{"given":"Marek","family":"Karpinski","sequence":"first","affiliation":[{"name":"University of Bonn, Bonn, Germany"}],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Warren","family":"Schudy","sequence":"additional","affiliation":[{"name":"Brown University, Providence, RI, USA"}],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"320","published-online":{"date-parts":[[2009,5,31]]},"reference":[{"key":"e_1_3_2_1_1_1","doi-asserted-by":"publisher","DOI":"10.1109\/SFCS.2005.36"},{"key":"e_1_3_2_1_2_1","doi-asserted-by":"publisher","DOI":"10.1145\/509907.509945"},{"key":"e_1_3_2_1_3_1","unstructured":"N. Alon R. Panigrahy and S. Yekhanin. Deterministic Approximation Algorithms for the Nearest Codeword Problem. Technical report Elec. Coll. on Comp. Compl. ECCC TR08--065 2008.  N. Alon R. Panigrahy and S. Yekhanin. Deterministic Approximation Algorithms for the Nearest Codeword Problem. Technical report Elec. Coll. on Comp. Compl. ECCC TR08--065 2008."},{"key":"e_1_3_2_1_4_1","doi-asserted-by":"publisher","DOI":"10.1006\/jcss.1997.1472"},{"key":"e_1_3_2_1_5_1","doi-asserted-by":"publisher","DOI":"10.5555\/874062.875527"},{"key":"e_1_3_2_1_6_1","doi-asserted-by":"publisher","DOI":"10.1145\/225058.225140"},{"key":"e_1_3_2_1_7_1","doi-asserted-by":"publisher","DOI":"10.1002\/rsa.10072"},{"key":"e_1_3_2_1_8_1","first-page":"514","volume-title":"Proc. 13th ACM-SIAM SODA","author":"Berman P.","year":"2002"},{"key":"e_1_3_2_1_9_1","doi-asserted-by":"publisher","DOI":"10.5555\/646255.684269"},{"key":"e_1_3_2_1_10_1","doi-asserted-by":"crossref","unstructured":"J. Carlson and D. Stolarski. The Correct Solution to Berlekamp's Switching Game. Discrete Mathematics 287(1--3):145--150 2004.  J. Carlson and D. Stolarski. The Correct Solution to Berlekamp's Switching Game. Discrete Mathematics 287(1--3):145--150 2004.","DOI":"10.1016\/j.disc.2004.06.015"},{"key":"e_1_3_2_1_11_1","doi-asserted-by":"publisher","DOI":"10.1007\/s00493-003-0019-y"},{"key":"e_1_3_2_1_12_1","doi-asserted-by":"publisher","DOI":"10.1145\/129712.129783"},{"key":"e_1_3_2_1_13_1","doi-asserted-by":"publisher","DOI":"10.1002\/(SICI)1098-2418(199605)8:3%3C187::AID-RSA3%3E3.0.CO;2-U"},{"key":"e_1_3_2_1_15_1","doi-asserted-by":"publisher","DOI":"10.1016\/0012-365X(89)90141-6"},{"key":"e_1_3_2_1_16_1","doi-asserted-by":"publisher","DOI":"10.1007\/s004930050052"},{"key":"e_1_3_2_1_17_1","doi-asserted-by":"publisher","DOI":"10.4086\/toc.2006.v002a013"},{"key":"e_1_3_2_1_18_1","doi-asserted-by":"publisher","DOI":"10.5555\/1109557.1109569"},{"key":"e_1_3_2_1_19_1","doi-asserted-by":"publisher","DOI":"10.5555\/795662.796271"},{"key":"e_1_3_2_1_20_1","first-page":"176","volume-title":"Proc. 19th ACM-SIAM SODA","author":"Mathieu C.","year":"2008"},{"key":"e_1_3_2_1_21_1","doi-asserted-by":"publisher","DOI":"10.1109\/TIT.2007.915716"},{"key":"e_1_3_2_1_22_1","doi-asserted-by":"publisher","DOI":"10.1145\/1255443.1255449"},{"volume-title":"Regional Conference Series, second edition","year":"1994","author":"Spencer J.","key":"e_1_3_2_1_23_1"}],"event":{"name":"STOC '09: Symposium on Theory of Computing","sponsor":["ACM Association for Computing Machinery","SIGACT ACM Special Interest Group on Algorithms and Computation Theory"],"location":"Bethesda MD USA","acronym":"STOC '09"},"container-title":["Proceedings of the forty-first annual ACM symposium on Theory of computing"],"original-title":[],"link":[{"URL":"https:\/\/dl.acm.org\/doi\/10.1145\/1536414.1536458","content-type":"unspecified","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/dl.acm.org\/doi\/pdf\/10.1145\/1536414.1536458","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2025,6,18]],"date-time":"2025-06-18T13:38:51Z","timestamp":1750253931000},"score":1,"resource":{"primary":{"URL":"https:\/\/dl.acm.org\/doi\/10.1145\/1536414.1536458"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2009,5,31]]},"references-count":22,"alternative-id":["10.1145\/1536414.1536458","10.1145\/1536414"],"URL":"https:\/\/doi.org\/10.1145\/1536414.1536458","relation":{},"subject":[],"published":{"date-parts":[[2009,5,31]]},"assertion":[{"value":"2009-05-31","order":2,"name":"published","label":"Published","group":{"name":"publication_history","label":"Publication History"}}]}}