{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,2,28]],"date-time":"2026-02-28T21:13:44Z","timestamp":1772313224148,"version":"3.50.1"},"publisher-location":"New York, NY, USA","reference-count":22,"publisher":"ACM","license":[{"start":{"date-parts":[[2012,1,8]],"date-time":"2012-01-08T00:00:00Z","timestamp":1325980800000},"content-version":"vor","delay-in-days":0,"URL":"https:\/\/www.acm.org\/publications\/policies\/copyright_policy#Background"}],"funder":[{"DOI":"10.13039\/100000143","name":"Division of Computing and Communication Foundations","doi-asserted-by":"publisher","award":["CCF-0747250"],"award-info":[{"award-number":["CCF-0747250"]}],"id":[{"id":"10.13039\/100000143","id-type":"DOI","asserted-by":"publisher"}]}],"content-domain":{"domain":["dl.acm.org"],"crossmark-restriction":true},"short-container-title":[],"published-print":{"date-parts":[[2012,1,8]]},"DOI":"10.1145\/2090236.2090274","type":"proceedings-article","created":{"date-parts":[[2012,1,10]],"date-time":"2012-01-10T17:02:17Z","timestamp":1326214937000},"page":"484-495","update-policy":"https:\/\/doi.org\/10.1145\/crossmark-policy","source":"Crossref","is-referenced-by-count":18,"title":["Linear programming, width-1 CSPs, and robust satisfaction"],"prefix":"10.1145","author":[{"given":"Gabor","family":"Kun","sequence":"first","affiliation":[{"name":"Institute for Advanced Study, and DIMACS"}]},{"given":"Ryan","family":"O'Donnell","sequence":"additional","affiliation":[{"name":"Carnegie Mellon University"}]},{"given":"Suguru","family":"Tamaki","sequence":"additional","affiliation":[{"name":"Kyoto University"}]},{"given":"Yuichi","family":"Yoshida","sequence":"additional","affiliation":[{"name":"Kyoto University, and Preferred Infrastructure, Inc."}]},{"given":"Yuan","family":"Zhou","sequence":"additional","affiliation":[{"name":"Carnegie Mellon University"}]}],"member":"320","published-online":{"date-parts":[[2012,1,8]]},"reference":[{"key":"e_1_3_2_1_1_1","doi-asserted-by":"publisher","DOI":"10.1137\/S0097539700376676"},{"key":"e_1_3_2_1_2_1","doi-asserted-by":"publisher","DOI":"10.1109\/FOCS.2009.32"},{"key":"e_1_3_2_1_3_1","doi-asserted-by":"publisher","DOI":"10.1016\/j.jalgebra.2004.07.044"},{"key":"e_1_3_2_1_4_1","volume-title":"Bounded relational width.","author":"Bulatov Andrei","year":"2009","unstructured":"{Bul09} Andrei Bulatov . Bounded relational width. Available at http:\/\/www.cs.sfu.ca\/~abulatov\/mpapers.html, 2009 . 1, 2.3 {Bul09} Andrei Bulatov. Bounded relational width. Available at http:\/\/www.cs.sfu.ca\/~abulatov\/mpapers.html, 2009. 1, 2.3"},{"key":"e_1_3_2_1_5_1","first-page":"3","article-title":"Two new homomorphism dualities and lattice operations","author":"Carvalho Catarina","year":"2010","unstructured":"{CDK10} Catarina Carvalho , V\u00edctor Dalmau , and Andrei Krokhin . Two new homomorphism dualities and lattice operations . Journal of Logic and Computation , 2010 . 3 .1 {CDK10} Catarina Carvalho, V\u00edctor Dalmau, and Andrei Krokhin. Two new homomorphism dualities and lattice operations. Journal of Logic and Computation, 2010. 3.1","journal-title":"Journal of Logic and Computation"},{"key":"e_1_3_2_1_6_1","doi-asserted-by":"publisher","DOI":"10.1145\/1132516.1132547"},{"key":"e_1_3_2_1_7_1","volume-title":"Electronic Colloquium on Computational Complexity TR06-064","author":"Charikar Moses","year":"2006","unstructured":"{CMM06b} Moses Charikar , Konstantin Makarychev , and Yury Makarychev . Note on MAX 2SAT . In Electronic Colloquium on Computational Complexity TR06-064 , 2006 . 1 {CMM06b} Moses Charikar, Konstantin Makarychev, and Yury Makarychev. Note on MAX 2SAT. In Electronic Colloquium on Computational Complexity TR06-064, 2006. 1"},{"key":"e_1_3_2_1_8_1","doi-asserted-by":"publisher","DOI":"10.5555\/647486.726506"},{"key":"e_1_3_2_1_9_1","doi-asserted-by":"publisher","DOI":"10.1137\/S0097539794266766"},{"key":"e_1_3_2_1_10_1","doi-asserted-by":"publisher","DOI":"10.1145\/227683.227684"},{"key":"e_1_3_2_1_11_1","doi-asserted-by":"publisher","DOI":"10.5555\/2133036.2133158"},{"key":"e_1_3_2_1_12_1","doi-asserted-by":"publisher","DOI":"10.1145\/502090.502098"},{"key":"e_1_3_2_1_13_1","doi-asserted-by":"publisher","DOI":"10.1145\/263867.263489"},{"key":"e_1_3_2_1_14_1","doi-asserted-by":"publisher","DOI":"10.1016\/j.tcs.2009.05.022"},{"key":"e_1_3_2_1_15_1","doi-asserted-by":"publisher","DOI":"10.1016\/S0022-0000(74)80044-9"},{"key":"e_1_3_2_1_16_1","doi-asserted-by":"publisher","DOI":"10.1145\/509907.510017"},{"key":"e_1_3_2_1_17_1","first-page":"1","article-title":"A new line of attack on the Dichotomy Conjecture","author":"Kun G\u00e1bor","year":"2009","unstructured":"{KS09} G\u00e1bor Kun and Mario Szegedy . A new line of attack on the Dichotomy Conjecture . In Electronic Colloquium on Computational Complexity TR09--059 , 2009 . 1 , 2 {KS09} G\u00e1bor Kun and Mario Szegedy. A new line of attack on the Dichotomy Conjecture. In Electronic Colloquium on Computational Complexity TR09--059, 2009. 1, 2","journal-title":"Electronic Colloquium on Computational Complexity TR09--059"},{"key":"e_1_3_2_1_18_1","doi-asserted-by":"publisher","DOI":"10.1137\/S0097539799349948"},{"key":"e_1_3_2_1_19_1","doi-asserted-by":"publisher","DOI":"10.1016\/0004-3702(77)90007-8"},{"key":"e_1_3_2_1_20_1","doi-asserted-by":"publisher","DOI":"10.1145\/1374376.1374414"},{"key":"e_1_3_2_1_21_1","doi-asserted-by":"publisher","DOI":"10.1145\/1993636.1993725"},{"key":"e_1_3_2_1_22_1","doi-asserted-by":"publisher","DOI":"10.1145\/276698.276869"}],"event":{"name":"ITCS '12: Innovations in Theoretical Computer Science","location":"Cambridge Massachusetts","acronym":"ITCS '12","sponsor":["SIGACT ACM Special Interest Group on Algorithms and Computation Theory"]},"container-title":["Proceedings of the 3rd Innovations in Theoretical Computer Science Conference"],"original-title":[],"link":[{"URL":"https:\/\/dl.acm.org\/doi\/10.1145\/2090236.2090274","content-type":"unspecified","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/dl.acm.org\/doi\/pdf\/10.1145\/2090236.2090274","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2025,6,18]],"date-time":"2025-06-18T10:06:46Z","timestamp":1750241206000},"score":1,"resource":{"primary":{"URL":"https:\/\/dl.acm.org\/doi\/10.1145\/2090236.2090274"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2012,1,8]]},"references-count":22,"alternative-id":["10.1145\/2090236.2090274","10.1145\/2090236"],"URL":"https:\/\/doi.org\/10.1145\/2090236.2090274","relation":{},"subject":[],"published":{"date-parts":[[2012,1,8]]},"assertion":[{"value":"2012-01-08","order":2,"name":"published","label":"Published","group":{"name":"publication_history","label":"Publication History"}}]}}