{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,11,18]],"date-time":"2025-11-18T12:11:53Z","timestamp":1763467913990,"version":"3.41.0"},"publisher-location":"New York, NY, USA","reference-count":30,"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.1536482","type":"proceedings-article","created":{"date-parts":[[2009,6,2]],"date-time":"2009-06-02T14:51:13Z","timestamp":1243954273000},"page":"493-502","update-policy":"https:\/\/doi.org\/10.1145\/crossmark-policy","source":"Crossref","is-referenced-by-count":17,"title":["Conditional hardness for satisfiable 3-CSPs"],"prefix":"10.1145","author":[{"given":"Ryan","family":"O'Donnell","sequence":"first","affiliation":[{"name":"Carnegie Mellon University, Pittsburgh, PA, USA"}],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Yi","family":"Wu","sequence":"additional","affiliation":[{"name":"Carnegie Mellon University, Pittsburgh, PA, 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.1145\/278298.278306"},{"key":"e_1_3_2_1_2_1","doi-asserted-by":"publisher","DOI":"10.1145\/273865.273901"},{"key":"e_1_3_2_1_3_1","doi-asserted-by":"publisher","DOI":"10.1145\/1250790.1250818"},{"key":"e_1_3_2_1_4_1","doi-asserted-by":"publisher","DOI":"10.1137\/S0097539796302531"},{"key":"e_1_3_2_1_5_1","doi-asserted-by":"publisher","DOI":"10.5802\/aif.297"},{"key":"e_1_3_2_1_6_1","doi-asserted-by":"publisher","DOI":"10.1006\/jcss.1995.1087"},{"key":"e_1_3_2_1_7_1","doi-asserted-by":"crossref","DOI":"10.1137\/1.9780898718546","volume-title":"Complexity classifications of boolean constraint satisfaction problems","author":"Creignou N.","year":"2001","unstructured":"N. Creignou , S. Khanna , and M. Sudan . Complexity classifications of boolean constraint satisfaction problems . SIAM , Philadelphia, PA , 2001 . N. Creignou, S. Khanna, and M. Sudan. Complexity classifications of boolean constraint satisfaction problems. SIAM, Philadelphia, PA, 2001."},{"key":"e_1_3_2_1_8_1","doi-asserted-by":"publisher","DOI":"10.1145\/1132516.1132567"},{"key":"e_1_3_2_1_9_1","doi-asserted-by":"publisher","DOI":"10.2307\/2373688"},{"key":"e_1_3_2_1_10_1","doi-asserted-by":"publisher","DOI":"10.1109\/CCC.2005.10"},{"key":"e_1_3_2_1_11_1","doi-asserted-by":"publisher","DOI":"10.1109\/SFCS.1998.743424"},{"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.4086\/toc.2005.v001a007"},{"key":"e_1_3_2_1_14_1","doi-asserted-by":"publisher","DOI":"10.5555\/795663.796364"},{"key":"e_1_3_2_1_15_1","doi-asserted-by":"publisher","DOI":"10.1145\/509907.510017"},{"key":"e_1_3_2_1_16_1","doi-asserted-by":"publisher","DOI":"10.1137\/S0097539705447372"},{"key":"e_1_3_2_1_17_1","doi-asserted-by":"publisher","DOI":"10.1109\/FOCS.2006.67"},{"key":"e_1_3_2_1_18_1","doi-asserted-by":"publisher","DOI":"10.1016\/j.jcss.2007.06.019"},{"key":"e_1_3_2_1_19_1","doi-asserted-by":"publisher","DOI":"10.1109\/CCC.2006.5"},{"key":"e_1_3_2_1_20_1","doi-asserted-by":"publisher","DOI":"10.1109\/FOCS.2008.44"},{"key":"e_1_3_2_1_21_1","doi-asserted-by":"publisher","DOI":"10.1109\/SFCS.2005.53"},{"key":"e_1_3_2_1_22_1","volume-title":"Analysis of boolean functions lecture notes","author":"O'Donnell R.","year":"2007","unstructured":"R. O'Donnell . Analysis of boolean functions lecture notes , 2007 . http:\/\/www.cs.cmu.edu\/ odonnell\/boolean-analysis\/. R. O'Donnell. Analysis of boolean functions lecture notes, 2007. http:\/\/www.cs.cmu.edu\/ odonnell\/boolean-analysis\/."},{"key":"e_1_3_2_1_23_1","doi-asserted-by":"publisher","DOI":"10.1145\/1374376.1374425"},{"key":"e_1_3_2_1_24_1","volume-title":"3-bit dictator testing: 1 vs. 5\/8","author":"O'Donnell R.","year":"2009","unstructured":"R. O'Donnell and Y. Wu . 3-bit dictator testing: 1 vs. 5\/8 , 2009 . To appear in Proc. 20th ACM-SIAM Symp . on Discrete Algorithms. R. O'Donnell and Y. Wu. 3-bit dictator testing: 1 vs. 5\/8, 2009. To appear in Proc. 20th ACM-SIAM Symp. on Discrete Algorithms."},{"key":"e_1_3_2_1_25_1","doi-asserted-by":"publisher","DOI":"10.1145\/1374376.1374414"},{"key":"e_1_3_2_1_26_1","doi-asserted-by":"publisher","DOI":"10.1137\/S0097539795280895"},{"key":"e_1_3_2_1_27_1","doi-asserted-by":"publisher","DOI":"10.1145\/335305.335329"},{"key":"e_1_3_2_1_28_1","doi-asserted-by":"publisher","DOI":"10.1137\/S0097539797328847"},{"key":"e_1_3_2_1_29_1","first-page":"201","volume-title":"Proc. 9th ACM-SIAM Symp. on Discrete Algorithms","author":"Zwick U.","year":"1998","unstructured":"U. Zwick . Approximation algorithms for constraint satisfaction problems involving at most three variables per constraint . In Proc. 9th ACM-SIAM Symp. on Discrete Algorithms , pages 201 -- 210 , 1998 . U. Zwick. Approximation algorithms for constraint satisfaction problems involving at most three variables per constraint. In Proc. 9th ACM-SIAM Symp. on Discrete Algorithms, pages 201--210, 1998."},{"key":"e_1_3_2_1_30_1","first-page":"496","volume-title":"Proc. 13th ACM-SIAM Symp. on Discrete Algorithms","author":"Zwick U.","year":"2002","unstructured":"U. Zwick . Computer assisted proof of optimal approximability results . In Proc. 13th ACM-SIAM Symp. on Discrete Algorithms , pages 496 -- 505 , 2002 . U. Zwick. Computer assisted proof of optimal approximability results. In Proc. 13th ACM-SIAM Symp. on Discrete Algorithms, pages 496--505, 2002."}],"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.1536482","content-type":"unspecified","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/dl.acm.org\/doi\/pdf\/10.1145\/1536414.1536482","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.1536482"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2009,5,31]]},"references-count":30,"alternative-id":["10.1145\/1536414.1536482","10.1145\/1536414"],"URL":"https:\/\/doi.org\/10.1145\/1536414.1536482","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"}}]}}