{"id":"https://openalex.org/W2027680861","doi":"https://doi.org/10.1145/2213977.2214076","title":"From query complexity to computational complexity","display_name":"From query complexity to computational complexity","publication_year":2012,"publication_date":"2012-05-19","ids":{"openalex":"https://openalex.org/W2027680861","doi":"https://doi.org/10.1145/2213977.2214076","mag":"2027680861"},"language":"en","primary_location":{"id":"doi:10.1145/2213977.2214076","is_oa":false,"landing_page_url":"https://doi.org/10.1145/2213977.2214076","pdf_url":null,"source":null,"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"Proceedings of the forty-fourth annual ACM symposium on Theory of computing","raw_type":"proceedings-article"},"type":"article","indexed_in":["crossref"],"open_access":{"is_oa":false,"oa_status":"closed","oa_url":null,"any_repository_has_fulltext":false},"authorships":[{"author_position":"first","author":{"id":"https://openalex.org/A5020176884","display_name":"Shahar Dobzinski","orcid":"https://orcid.org/0000-0003-1935-5808"},"institutions":[{"id":"https://openalex.org/I205783295","display_name":"Cornell University","ror":"https://ror.org/05bnh6r87","country_code":"US","type":"education","lineage":["https://openalex.org/I205783295"]}],"countries":["US"],"is_corresponding":true,"raw_author_name":"Shahar Dobzinski","raw_affiliation_strings":["Cornell University, Ithaca, NY, USA"],"affiliations":[{"raw_affiliation_string":"Cornell University, Ithaca, NY, USA","institution_ids":["https://openalex.org/I205783295"]}]},{"author_position":"last","author":{"id":"https://openalex.org/A5003968234","display_name":"J. Vondr\u00e1k","orcid":"https://orcid.org/0000-0002-4674-0771"},"institutions":[{"id":"https://openalex.org/I4210085935","display_name":"IBM Research - Almaden","ror":"https://ror.org/005w8dd04","country_code":"US","type":"facility","lineage":["https://openalex.org/I1341412227","https://openalex.org/I4210085935","https://openalex.org/I4210114115"]}],"countries":["US"],"is_corresponding":false,"raw_author_name":"Jan Vondrak","raw_affiliation_strings":["IBM Almaden Research Center, San Jose, CA, USA"],"affiliations":[{"raw_affiliation_string":"IBM Almaden Research Center, San Jose, CA, USA","institution_ids":["https://openalex.org/I4210085935"]}]}],"institutions":[],"countries_distinct_count":1,"institutions_distinct_count":2,"corresponding_author_ids":["https://openalex.org/A5020176884"],"corresponding_institution_ids":["https://openalex.org/I205783295"],"apc_list":null,"apc_paid":null,"fwci":5.5286,"has_fulltext":false,"cited_by_count":48,"citation_normalized_percentile":{"value":0.96175691,"is_in_top_1_percent":false,"is_in_top_10_percent":true},"cited_by_percentile_year":{"min":89,"max":99},"biblio":{"volume":null,"issue":null,"first_page":"1107","last_page":"1116"},"is_retracted":false,"is_paratext":false,"is_xpac":false,"primary_topic":{"id":"https://openalex.org/T10720","display_name":"Complexity and Algorithms in Graphs","score":0.9993000030517578,"subfield":{"id":"https://openalex.org/subfields/1703","display_name":"Computational Theory and Mathematics"},"field":{"id":"https://openalex.org/fields/17","display_name":"Computer Science"},"domain":{"id":"https://openalex.org/domains/3","display_name":"Physical Sciences"}},"topics":[{"id":"https://openalex.org/T10720","display_name":"Complexity and Algorithms in Graphs","score":0.9993000030517578,"subfield":{"id":"https://openalex.org/subfields/1703","display_name":"Computational Theory and Mathematics"},"field":{"id":"https://openalex.org/fields/17","display_name":"Computer Science"},"domain":{"id":"https://openalex.org/domains/3","display_name":"Physical Sciences"}},{"id":"https://openalex.org/T11182","display_name":"Auction Theory and Applications","score":0.9976999759674072,"subfield":{"id":"https://openalex.org/subfields/1803","display_name":"Management Science and Operations Research"},"field":{"id":"https://openalex.org/fields/18","display_name":"Decision Sciences"},"domain":{"id":"https://openalex.org/domains/2","display_name":"Social Sciences"}},{"id":"https://openalex.org/T10237","display_name":"Cryptography and Data Security","score":0.994700014591217,"subfield":{"id":"https://openalex.org/subfields/1702","display_name":"Artificial Intelligence"},"field":{"id":"https://openalex.org/fields/17","display_name":"Computer Science"},"domain":{"id":"https://openalex.org/domains/3","display_name":"Physical Sciences"}}],"keywords":[{"id":"https://openalex.org/keywords/submodular-set-function","display_name":"Submodular set function","score":0.9572088122367859},{"id":"https://openalex.org/keywords/oracle","display_name":"Oracle","score":0.6276289820671082},{"id":"https://openalex.org/keywords/matroid","display_name":"Matroid","score":0.617340087890625},{"id":"https://openalex.org/keywords/mathematics","display_name":"Mathematics","score":0.5866354703903198},{"id":"https://openalex.org/keywords/combinatorics","display_name":"Combinatorics","score":0.5491786003112793},{"id":"https://openalex.org/keywords/cardinality","display_name":"Cardinality (data modeling)","score":0.513909101486206},{"id":"https://openalex.org/keywords/computational-complexity-theory","display_name":"Computational complexity theory","score":0.5043522119522095},{"id":"https://openalex.org/keywords/function","display_name":"Function (biology)","score":0.4943430423736572},{"id":"https://openalex.org/keywords/constant","display_name":"Constant (computer programming)","score":0.46565964818000793},{"id":"https://openalex.org/keywords/monotone-polygon","display_name":"Monotone polygon","score":0.4656556248664856},{"id":"https://openalex.org/keywords/approximation-algorithm","display_name":"Approximation algorithm","score":0.43287304043769836},{"id":"https://openalex.org/keywords/reduction","display_name":"Reduction (mathematics)","score":0.4265406131744385},{"id":"https://openalex.org/keywords/discrete-mathematics","display_name":"Discrete mathematics","score":0.4128879904747009},{"id":"https://openalex.org/keywords/computer-science","display_name":"Computer science","score":0.2786408066749573},{"id":"https://openalex.org/keywords/algorithm","display_name":"Algorithm","score":0.1602649688720703}],"concepts":[{"id":"https://openalex.org/C178621042","wikidata":"https://www.wikidata.org/wiki/Q7631710","display_name":"Submodular set function","level":2,"score":0.9572088122367859},{"id":"https://openalex.org/C55166926","wikidata":"https://www.wikidata.org/wiki/Q2892946","display_name":"Oracle","level":2,"score":0.6276289820671082},{"id":"https://openalex.org/C106286213","wikidata":"https://www.wikidata.org/wiki/Q898572","display_name":"Matroid","level":2,"score":0.617340087890625},{"id":"https://openalex.org/C33923547","wikidata":"https://www.wikidata.org/wiki/Q395","display_name":"Mathematics","level":0,"score":0.5866354703903198},{"id":"https://openalex.org/C114614502","wikidata":"https://www.wikidata.org/wiki/Q76592","display_name":"Combinatorics","level":1,"score":0.5491786003112793},{"id":"https://openalex.org/C87117476","wikidata":"https://www.wikidata.org/wiki/Q362383","display_name":"Cardinality (data modeling)","level":2,"score":0.513909101486206},{"id":"https://openalex.org/C179799912","wikidata":"https://www.wikidata.org/wiki/Q205084","display_name":"Computational complexity theory","level":2,"score":0.5043522119522095},{"id":"https://openalex.org/C14036430","wikidata":"https://www.wikidata.org/wiki/Q3736076","display_name":"Function (biology)","level":2,"score":0.4943430423736572},{"id":"https://openalex.org/C2777027219","wikidata":"https://www.wikidata.org/wiki/Q1284190","display_name":"Constant (computer programming)","level":2,"score":0.46565964818000793},{"id":"https://openalex.org/C2834757","wikidata":"https://www.wikidata.org/wiki/Q4925424","display_name":"Monotone polygon","level":2,"score":0.4656556248664856},{"id":"https://openalex.org/C148764684","wikidata":"https://www.wikidata.org/wiki/Q621751","display_name":"Approximation algorithm","level":2,"score":0.43287304043769836},{"id":"https://openalex.org/C111335779","wikidata":"https://www.wikidata.org/wiki/Q3454686","display_name":"Reduction (mathematics)","level":2,"score":0.4265406131744385},{"id":"https://openalex.org/C118615104","wikidata":"https://www.wikidata.org/wiki/Q121416","display_name":"Discrete mathematics","level":1,"score":0.4128879904747009},{"id":"https://openalex.org/C41008148","wikidata":"https://www.wikidata.org/wiki/Q21198","display_name":"Computer science","level":0,"score":0.2786408066749573},{"id":"https://openalex.org/C11413529","wikidata":"https://www.wikidata.org/wiki/Q8366","display_name":"Algorithm","level":1,"score":0.1602649688720703},{"id":"https://openalex.org/C199360897","wikidata":"https://www.wikidata.org/wiki/Q9143","display_name":"Programming language","level":1,"score":0.0},{"id":"https://openalex.org/C2524010","wikidata":"https://www.wikidata.org/wiki/Q8087","display_name":"Geometry","level":1,"score":0.0},{"id":"https://openalex.org/C115903868","wikidata":"https://www.wikidata.org/wiki/Q80993","display_name":"Software engineering","level":1,"score":0.0},{"id":"https://openalex.org/C124101348","wikidata":"https://www.wikidata.org/wiki/Q172491","display_name":"Data mining","level":1,"score":0.0},{"id":"https://openalex.org/C78458016","wikidata":"https://www.wikidata.org/wiki/Q840400","display_name":"Evolutionary biology","level":1,"score":0.0},{"id":"https://openalex.org/C86803240","wikidata":"https://www.wikidata.org/wiki/Q420","display_name":"Biology","level":0,"score":0.0}],"mesh":[],"locations_count":3,"locations":[{"id":"doi:10.1145/2213977.2214076","is_oa":false,"landing_page_url":"https://doi.org/10.1145/2213977.2214076","pdf_url":null,"source":null,"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"Proceedings of the forty-fourth annual ACM symposium on Theory of computing","raw_type":"proceedings-article"},{"id":"pmh:oai:CiteSeerX.psu:10.1.1.232.9598","is_oa":false,"landing_page_url":"http://citeseerx.ist.psu.edu/viewdoc/summary?doi=10.1.1.232.9598","pdf_url":null,"source":null,"license":null,"license_id":null,"version":"submittedVersion","is_accepted":false,"is_published":false,"raw_source_name":"http://theory.stanford.edu/%7Ejvondrak/data/querytocc.pdf","raw_type":"text"},{"id":"pmh:oai:CiteSeerX.psu:10.1.1.307.3011","is_oa":false,"landing_page_url":"http://citeseerx.ist.psu.edu/viewdoc/summary?doi=10.1.1.307.3011","pdf_url":null,"source":null,"license":null,"license_id":null,"version":"submittedVersion","is_accepted":false,"is_published":false,"raw_source_name":"http://theory.stanford.edu/~jvondrak/data/querytocc.pdf","raw_type":"text"}],"best_oa_location":null,"sustainable_development_goals":[],"awards":[],"funders":[],"has_content":{"grobid_xml":false,"pdf":false},"content_urls":null,"referenced_works_count":25,"referenced_works":["https://openalex.org/W1542719709","https://openalex.org/W1579522749","https://openalex.org/W1580387990","https://openalex.org/W1665118812","https://openalex.org/W1680189815","https://openalex.org/W1989453388","https://openalex.org/W2027680861","https://openalex.org/W2031122640","https://openalex.org/W2037340562","https://openalex.org/W2038938388","https://openalex.org/W2045492898","https://openalex.org/W2057512592","https://openalex.org/W2059527251","https://openalex.org/W2078273056","https://openalex.org/W2118827435","https://openalex.org/W2128274978","https://openalex.org/W2141502056","https://openalex.org/W2143996311","https://openalex.org/W2157316274","https://openalex.org/W2169319812","https://openalex.org/W2170003889","https://openalex.org/W2405647528","https://openalex.org/W2962711478","https://openalex.org/W3118655244","https://openalex.org/W4301709644"],"related_works":["https://openalex.org/W4320232260","https://openalex.org/W4252399622","https://openalex.org/W1499990180","https://openalex.org/W4241672388","https://openalex.org/W4321600307","https://openalex.org/W4398796424","https://openalex.org/W2950365512","https://openalex.org/W1608444752","https://openalex.org/W3204684126","https://openalex.org/W2062310236"],"abstract_inverted_index":{"We":[0],"consider":[1],"submodular":[2,28,58,75,86,98],"optimization":[3],"problems,":[4],"and":[5,91],"provide":[6],"a":[7,55,84,96,102,130],"general":[8],"way":[9],"of":[10,41,49,63,109],"translating":[11],"oracle":[12],"inapproximability":[13,24,111],"results":[14],"arising":[15],"from":[16,133],"the":[17,27,34,106,118,122],"symmetry":[18],"gap":[19],"technique":[20,43],"to":[21,101],"computational":[22,47,110],"complexity":[23],"results,":[25,112],"where":[26],"function":[29,87,99],"is":[30],"given":[31],"explicitly":[32],"(under":[33],"assumption":[35],"that":[36],"NP":[37],"\u2260":[38],"RP).":[39],"Applications":[40],"our":[42,113],"include":[44],"an":[45,60],"optimal":[46,61],"hardness":[48,62,81],"(1/2":[50],"+":[51,65],"\u03b5)-approximation":[52,66],"for":[53,67,82,94],"maximizing":[54,83,95],"symmetric":[56],"nonnegative":[57,85],"function,":[59],"(1-(1-1/k)k":[64],"welfare":[68],"maximization":[69],"in":[70],"combinatorial":[71],"auctions":[72],"with":[73],"k":[74],"bidders":[76],"(for":[77],"constant":[78],"k),":[79],"super-constant":[80],"over":[88],"matroid":[89],"bases,":[90],"tighter":[92],"bounds":[93],"monotone":[97],"subject":[100],"cardinality":[103],"constraint.":[104],"Unlike":[105],"vast":[107],"majority":[108],"approach":[114],"does":[115],"not":[116],"use":[117],"PCP":[119],"machinery":[120],"or":[121],"Unique":[123],"Games":[124],"Conjecture,":[125],"but":[126],"relies":[127],"instead":[128],"on":[129],"direct":[131],"reduction":[132],"Unique-SAT":[134],"using":[135],"list-decodable":[136],"codes.":[137]},"counts_by_year":[{"year":2026,"cited_by_count":1},{"year":2025,"cited_by_count":1},{"year":2024,"cited_by_count":2},{"year":2023,"cited_by_count":1},{"year":2022,"cited_by_count":2},{"year":2021,"cited_by_count":1},{"year":2020,"cited_by_count":5},{"year":2019,"cited_by_count":4},{"year":2018,"cited_by_count":6},{"year":2016,"cited_by_count":6},{"year":2015,"cited_by_count":4},{"year":2014,"cited_by_count":5},{"year":2013,"cited_by_count":3},{"year":2012,"cited_by_count":4}],"updated_date":"2026-04-05T17:49:38.594831","created_date":"2025-10-10T00:00:00"}