{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,4,24]],"date-time":"2026-04-24T04:56:45Z","timestamp":1777006605628,"version":"3.51.4"},"publisher-location":"New York, NY, USA","reference-count":15,"publisher":"ACM","license":[{"start":{"date-parts":[[2012,5,19]],"date-time":"2012-05-19T00:00:00Z","timestamp":1337385600000},"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":[[2012,5,19]]},"DOI":"10.1145\/2213977.2214076","type":"proceedings-article","created":{"date-parts":[[2012,5,21]],"date-time":"2012-05-21T15:20:35Z","timestamp":1337613635000},"page":"1107-1116","update-policy":"https:\/\/doi.org\/10.1145\/crossmark-policy","source":"Crossref","is-referenced-by-count":20,"title":["From query complexity to computational complexity"],"prefix":"10.1145","author":[{"given":"Shahar","family":"Dobzinski","sequence":"first","affiliation":[{"name":"Cornell University, Ithaca, NY, USA"}]},{"given":"Jan","family":"Vondrak","sequence":"additional","affiliation":[{"name":"IBM Almaden Research Center, San Jose, CA, USA"}]}],"member":"320","published-online":{"date-parts":[[2012,5,19]]},"reference":[{"key":"e_1_3_2_2_1_1","volume-title":"SODA'10","author":"Buchfuhrer Dave","unstructured":"Dave Buchfuhrer , Shaddin Dughmi , Hu Fu , Robert Kleinberg , Elchanan Mossel , Christos Papadimitriou , Michael Schapira , Yaron Singer , and Chris Umans . Inapproximability for VCG-based combinatorial auctions . In SODA'10 . Dave Buchfuhrer, Shaddin Dughmi, Hu Fu, Robert Kleinberg, Elchanan Mossel, Christos Papadimitriou, Michael Schapira, Yaron Singer, and Chris Umans. Inapproximability for VCG-based combinatorial auctions. In SODA'10."},{"key":"e_1_3_2_2_2_1","doi-asserted-by":"publisher","DOI":"10.1145\/1807342.1807348"},{"key":"e_1_3_2_2_3_1","doi-asserted-by":"publisher","DOI":"10.1145\/1993636.1993656"},{"key":"e_1_3_2_2_4_1","doi-asserted-by":"publisher","DOI":"10.1007\/978-3-540-74208-1_7"},{"key":"e_1_3_2_2_5_1","doi-asserted-by":"publisher","DOI":"10.1145\/1250790.1250842"},{"key":"e_1_3_2_2_6_1","volume-title":"From query complexity to computational complexity","author":"Dobzinski Shahar","year":"2012","unstructured":"Shahar Dobzinski and Jan Vondr\u00e1k . From query complexity to computational complexity , 2012 . submitted. Shahar Dobzinski and Jan Vondr\u00e1k. From query complexity to computational complexity, 2012. submitted."},{"key":"e_1_3_2_2_7_1","doi-asserted-by":"publisher","DOI":"10.1145\/1993574.1993614"},{"key":"e_1_3_2_2_8_1","doi-asserted-by":"publisher","DOI":"10.1145\/1993636.1993657"},{"key":"e_1_3_2_2_9_1","doi-asserted-by":"publisher","DOI":"10.1109\/FOCS.2011.64"},{"key":"e_1_3_2_2_10_1","volume-title":"Limitations of randomized mechanisms for combinatorial auctions","author":"Dughmi Shaddin","year":"2011","unstructured":"Shaddin Dughmi and Jan Vondr\u00e1k . Limitations of randomized mechanisms for combinatorial auctions , 2011 . Manuscript , arxiv.org:1109.1055. Shaddin Dughmi and Jan Vondr\u00e1k. Limitations of randomized mechanisms for combinatorial auctions, 2011. Manuscript, arxiv.org:1109.1055."},{"key":"e_1_3_2_2_11_1","doi-asserted-by":"publisher","DOI":"10.1145\/285055.285059"},{"key":"e_1_3_2_2_12_1","doi-asserted-by":"publisher","DOI":"10.1109\/CCC.2008.13"},{"key":"e_1_3_2_2_13_1","doi-asserted-by":"publisher","DOI":"10.1109\/FOCS.2008.54"},{"key":"e_1_3_2_2_14_1","doi-asserted-by":"publisher","DOI":"10.1145\/1374376.1374389"},{"key":"e_1_3_2_2_15_1","volume-title":"FOCS'09","author":"Vondr\u00e1k Jan","unstructured":"Jan Vondr\u00e1k . Symmetry and approximability of submodular maximization problems . In FOCS'09 . Jan Vondr\u00e1k. Symmetry and approximability of submodular maximization problems. In FOCS'09."}],"event":{"name":"STOC'12: Symposium on Theory of Computing","location":"New York New York USA","acronym":"STOC'12","sponsor":["SIGACT ACM Special Interest Group on Algorithms and Computation Theory"]},"container-title":["Proceedings of the forty-fourth annual ACM symposium on Theory of computing"],"original-title":[],"link":[{"URL":"https:\/\/dl.acm.org\/doi\/10.1145\/2213977.2214076","content-type":"unspecified","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/dl.acm.org\/doi\/pdf\/10.1145\/2213977.2214076","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2025,6,18]],"date-time":"2025-06-18T09:20:56Z","timestamp":1750238456000},"score":1,"resource":{"primary":{"URL":"https:\/\/dl.acm.org\/doi\/10.1145\/2213977.2214076"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2012,5,19]]},"references-count":15,"alternative-id":["10.1145\/2213977.2214076","10.1145\/2213977"],"URL":"https:\/\/doi.org\/10.1145\/2213977.2214076","relation":{},"subject":[],"published":{"date-parts":[[2012,5,19]]},"assertion":[{"value":"2012-05-19","order":2,"name":"published","label":"Published","group":{"name":"publication_history","label":"Publication History"}}]}}