{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,6,19]],"date-time":"2025-06-19T04:35:37Z","timestamp":1750307737136,"version":"3.41.0"},"publisher-location":"New York, NY, USA","reference-count":20,"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.1536481","type":"proceedings-article","created":{"date-parts":[[2009,6,2]],"date-time":"2009-06-02T14:51:13Z","timestamp":1243954273000},"page":"483-492","update-policy":"https:\/\/doi.org\/10.1145\/crossmark-policy","source":"Crossref","is-referenced-by-count":9,"title":["Randomly supported independence and resistance"],"prefix":"10.1145","author":[{"given":"Per","family":"Austrin","sequence":"first","affiliation":[{"name":"KTH - Royal Institute of Technology, Stockholm, Sweden"}],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Johan","family":"H\u00e5stad","sequence":"additional","affiliation":[{"name":"KTH - Royal Institute of Technology, Stockholm, Sweden"}],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"320","published-online":{"date-parts":[[2009,5,31]]},"reference":[{"doi-asserted-by":"publisher","key":"e_1_3_2_1_1_1","DOI":"10.1145\/1374376.1374380"},{"doi-asserted-by":"publisher","key":"e_1_3_2_1_3_1","DOI":"10.1109\/CCC.2008.20"},{"doi-asserted-by":"publisher","key":"e_1_3_2_1_4_1","DOI":"10.2307\/1970980"},{"doi-asserted-by":"publisher","key":"e_1_3_2_1_5_1","DOI":"10.5802\/aif.357"},{"doi-asserted-by":"publisher","key":"e_1_3_2_1_6_1","DOI":"10.1145\/1132516.1132547"},{"doi-asserted-by":"publisher","key":"e_1_3_2_1_7_1","DOI":"10.1145\/1132516.1132580"},{"doi-asserted-by":"publisher","key":"e_1_3_2_1_8_1","DOI":"10.1007\/BF02187704"},{"doi-asserted-by":"publisher","key":"e_1_3_2_1_9_1","DOI":"10.1145\/227683.227684"},{"doi-asserted-by":"publisher","key":"e_1_3_2_1_10_1","DOI":"10.5555\/795664.796391"},{"doi-asserted-by":"publisher","key":"e_1_3_2_1_12_1","DOI":"10.1145\/502090.502098"},{"doi-asserted-by":"publisher","key":"e_1_3_2_1_13_1","DOI":"10.1145\/1060590.1060700"},{"doi-asserted-by":"publisher","key":"e_1_3_2_1_14_1","DOI":"10.1007\/978-3-540-74208-1_11"},{"doi-asserted-by":"publisher","key":"e_1_3_2_1_15_1","DOI":"10.1017\/CBO9780511526169"},{"doi-asserted-by":"publisher","key":"e_1_3_2_1_16_1","DOI":"10.1145\/509907.510017"},{"issue":"1","key":"e_1_3_2_1_17_1","first-page":"99","article-title":"Constructive approximation of a ball by polytopes","volume":"44","author":"Kochol M.","year":"1994","unstructured":"M. Kochol . Constructive approximation of a ball by polytopes . Math. Slovaca , 44 ( 1 ): 99 -- 105 , 1994 . M. Kochol. Constructive approximation of a ball by polytopes. Math. Slovaca, 44(1):99--105, 1994.","journal-title":"Math. Slovaca"},{"key":"e_1_3_2_1_18_1","volume-title":"Gaussian bounds for noise correlation of functions. arXiv Report math\/0703683v3","author":"Mossel E.","year":"2007","unstructured":"E. Mossel . Gaussian bounds for noise correlation of functions. arXiv Report math\/0703683v3 , 2007 . E. Mossel. Gaussian bounds for noise correlation of functions. arXiv Report math\/0703683v3, 2007."},{"doi-asserted-by":"publisher","key":"e_1_3_2_1_19_1","DOI":"10.1145\/335305.335329"},{"doi-asserted-by":"publisher","key":"e_1_3_2_1_20_1","DOI":"10.1145\/1132516.1132519"},{"doi-asserted-by":"publisher","key":"e_1_3_2_1_21_1","DOI":"10.1109\/SFCS.2005.22"},{"key":"e_1_3_2_1_22_1","volume-title":"ACM-SIAM Symposium on Discrete Algorithms (SODA)","author":"Zwick U.","year":"1998","unstructured":"U. Zwick . Approximation Algorithms for Constraint Satisfaction Problems Involving at Most Three Variables Per Constraint . In ACM-SIAM Symposium on Discrete Algorithms (SODA) , 1998 . U. Zwick. Approximation Algorithms for Constraint Satisfaction Problems Involving at Most Three Variables Per Constraint. In ACM-SIAM Symposium on Discrete Algorithms (SODA), 1998."}],"event":{"sponsor":["ACM Association for Computing Machinery","SIGACT ACM Special Interest Group on Algorithms and Computation Theory"],"acronym":"STOC '09","name":"STOC '09: Symposium on Theory of Computing","location":"Bethesda MD USA"},"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.1536481","content-type":"unspecified","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/dl.acm.org\/doi\/pdf\/10.1145\/1536414.1536481","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.1536481"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2009,5,31]]},"references-count":20,"alternative-id":["10.1145\/1536414.1536481","10.1145\/1536414"],"URL":"https:\/\/doi.org\/10.1145\/1536414.1536481","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"}}]}}