{"id":"https://openalex.org/W2100299728","doi":"https://doi.org/10.1109/ccc.2009.12","title":"Worst-Case Running Times for Average-Case Algorithms","display_name":"Worst-Case Running Times for Average-Case Algorithms","publication_year":2009,"publication_date":"2009-07-01","ids":{"openalex":"https://openalex.org/W2100299728","doi":"https://doi.org/10.1109/ccc.2009.12","mag":"2100299728"},"language":"en","primary_location":{"id":"doi:10.1109/ccc.2009.12","is_oa":false,"landing_page_url":"https://doi.org/10.1109/ccc.2009.12","pdf_url":null,"source":null,"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"2009 24th Annual IEEE Conference on Computational Complexity","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/A5048190616","display_name":"Lu\u00eds Antunes","orcid":"https://orcid.org/0000-0002-9988-594X"},"institutions":[{"id":"https://openalex.org/I4210120471","display_name":"Instituto de Telecomunica\u00e7\u00f5es","ror":"https://ror.org/02ht4fk33","country_code":"PT","type":"nonprofit","lineage":["https://openalex.org/I4210120471"]},{"id":"https://openalex.org/I182534213","display_name":"Universidade do Porto","ror":"https://ror.org/043pwc612","country_code":"PT","type":"education","lineage":["https://openalex.org/I182534213"]}],"countries":["PT"],"is_corresponding":true,"raw_author_name":"Lu\u00eds Antunes","raw_affiliation_strings":["Instituto de telecomunica\u00e7\u014des, Faculdade de Ci\u00eancias d, Universidade do Porto, Porto, Portugal","Fac. de Cienc. da U. Porto, Inst. de Telecomun., Porto, Portugal"],"affiliations":[{"raw_affiliation_string":"Instituto de telecomunica\u00e7\u014des, Faculdade de Ci\u00eancias d, Universidade do Porto, Porto, Portugal","institution_ids":["https://openalex.org/I4210120471","https://openalex.org/I182534213"]},{"raw_affiliation_string":"Fac. de Cienc. da U. Porto, Inst. de Telecomun., Porto, Portugal","institution_ids":["https://openalex.org/I4210120471","https://openalex.org/I182534213"]}]},{"author_position":"last","author":{"id":"https://openalex.org/A5075191567","display_name":"Lance Fortnow","orcid":"https://orcid.org/0000-0002-2020-1358"},"institutions":[{"id":"https://openalex.org/I111979921","display_name":"Northwestern University","ror":"https://ror.org/000e0be47","country_code":"US","type":"education","lineage":["https://openalex.org/I111979921"]}],"countries":["US"],"is_corresponding":false,"raw_author_name":"Lance Fortnow","raw_affiliation_strings":["EECS Department, Northwestern University, Evanston, IL, USA","EECS Department, Northwestern University, Evanston, IL USA#TAB#"],"affiliations":[{"raw_affiliation_string":"EECS Department, Northwestern University, Evanston, IL, USA","institution_ids":["https://openalex.org/I111979921"]},{"raw_affiliation_string":"EECS Department, Northwestern University, Evanston, IL USA#TAB#","institution_ids":["https://openalex.org/I111979921"]}]}],"institutions":[],"countries_distinct_count":2,"institutions_distinct_count":2,"corresponding_author_ids":["https://openalex.org/A5048190616"],"corresponding_institution_ids":["https://openalex.org/I182534213","https://openalex.org/I4210120471"],"apc_list":null,"apc_paid":null,"fwci":0.707,"has_fulltext":false,"cited_by_count":17,"citation_normalized_percentile":{"value":0.72541487,"is_in_top_1_percent":false,"is_in_top_10_percent":false},"cited_by_percentile_year":{"min":89,"max":98},"biblio":{"volume":null,"issue":null,"first_page":"298","last_page":"303"},"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.9998999834060669,"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.9998999834060669,"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/T12072","display_name":"Machine Learning and Algorithms","score":0.9998000264167786,"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"}},{"id":"https://openalex.org/T12288","display_name":"Optimization and Search Problems","score":0.9991999864578247,"subfield":{"id":"https://openalex.org/subfields/1705","display_name":"Computer Networks and Communications"},"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/polynomial","display_name":"Polynomial","score":0.6443324089050293},{"id":"https://openalex.org/keywords/bounded-function","display_name":"Bounded function","score":0.49190187454223633},{"id":"https://openalex.org/keywords/combinatorics","display_name":"Combinatorics","score":0.46654415130615234},{"id":"https://openalex.org/keywords/algorithm","display_name":"Algorithm","score":0.4200409948825836},{"id":"https://openalex.org/keywords/exponential-function","display_name":"Exponential function","score":0.41952720284461975},{"id":"https://openalex.org/keywords/discrete-mathematics","display_name":"Discrete mathematics","score":0.3834775984287262},{"id":"https://openalex.org/keywords/mathematics","display_name":"Mathematics","score":0.33619630336761475},{"id":"https://openalex.org/keywords/mathematical-analysis","display_name":"Mathematical analysis","score":0.12164241075515747}],"concepts":[{"id":"https://openalex.org/C90119067","wikidata":"https://www.wikidata.org/wiki/Q43260","display_name":"Polynomial","level":2,"score":0.6443324089050293},{"id":"https://openalex.org/C34388435","wikidata":"https://www.wikidata.org/wiki/Q2267362","display_name":"Bounded function","level":2,"score":0.49190187454223633},{"id":"https://openalex.org/C114614502","wikidata":"https://www.wikidata.org/wiki/Q76592","display_name":"Combinatorics","level":1,"score":0.46654415130615234},{"id":"https://openalex.org/C11413529","wikidata":"https://www.wikidata.org/wiki/Q8366","display_name":"Algorithm","level":1,"score":0.4200409948825836},{"id":"https://openalex.org/C151376022","wikidata":"https://www.wikidata.org/wiki/Q168698","display_name":"Exponential function","level":2,"score":0.41952720284461975},{"id":"https://openalex.org/C118615104","wikidata":"https://www.wikidata.org/wiki/Q121416","display_name":"Discrete mathematics","level":1,"score":0.3834775984287262},{"id":"https://openalex.org/C33923547","wikidata":"https://www.wikidata.org/wiki/Q395","display_name":"Mathematics","level":0,"score":0.33619630336761475},{"id":"https://openalex.org/C134306372","wikidata":"https://www.wikidata.org/wiki/Q7754","display_name":"Mathematical analysis","level":1,"score":0.12164241075515747}],"mesh":[],"locations_count":2,"locations":[{"id":"doi:10.1109/ccc.2009.12","is_oa":false,"landing_page_url":"https://doi.org/10.1109/ccc.2009.12","pdf_url":null,"source":null,"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"2009 24th Annual IEEE Conference on Computational Complexity","raw_type":"proceedings-article"},{"id":"pmh:oai:CiteSeerX.psu:10.1.1.156.71","is_oa":false,"landing_page_url":"http://citeseerx.ist.psu.edu/viewdoc/summary?doi=10.1.1.156.71","pdf_url":null,"source":null,"license":null,"license_id":null,"version":"submittedVersion","is_accepted":false,"is_published":false,"raw_source_name":"http://www.cs.uchicago.edu/~fortnow/papers/ud.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":17,"referenced_works":["https://openalex.org/W155737957","https://openalex.org/W1513275674","https://openalex.org/W1536821607","https://openalex.org/W1638203394","https://openalex.org/W1979479253","https://openalex.org/W1998918799","https://openalex.org/W2006252547","https://openalex.org/W2014603110","https://openalex.org/W2083237534","https://openalex.org/W2100008268","https://openalex.org/W2173249896","https://openalex.org/W2439499148","https://openalex.org/W2504959571","https://openalex.org/W4230960895","https://openalex.org/W4250871362","https://openalex.org/W4252948584","https://openalex.org/W6606312583"],"related_works":["https://openalex.org/W4391375266","https://openalex.org/W3013085049","https://openalex.org/W1560496689","https://openalex.org/W1992739770","https://openalex.org/W4386900933","https://openalex.org/W2980963558","https://openalex.org/W4229058035","https://openalex.org/W3125672081","https://openalex.org/W4385301946","https://openalex.org/W2006389905"],"abstract_inverted_index":{"Under":[0],"a":[1],"standard":[2],"hardness":[3,127],"assumption":[4],"we":[5,26,122],"exactly":[6],"characterize":[7],"the":[8,40,66,91,107,110,126,129,153],"worst-case":[9],"running":[10,67],"time":[11,31,57,68,116],"of":[12,95,109],"languages":[13],"that":[14,28],"are":[15,42],"in":[16,36,56],"average":[17],"polynomial-time":[18,21,130],"over":[19],"all":[20,50,63,85],"samplable":[22],"distributions.":[23,155],"More":[24],"precisely":[25],"show":[27,123],"if":[29],"exponential":[30],"is":[32,71,90,106,150],"not":[33],"infinitely":[34],"often":[35],"subexponential":[37],"space,":[38],"then":[39],"following":[41],"equivalent":[43],"for":[44,69,84],"any":[45],"algorithm":[46],"A:":[47],"(1)":[48],"For":[49,62],"P-samplable":[51,154],"distributions":[52],"mu,":[53],"A":[54,70],"runs":[55],"polynomial":[58,64],"on":[59],"mu-average.":[60],"(2)":[61],"p,":[65],"bounded":[72],"by":[73],"2":[74,139],"<sup":[75,78,81,102,134,140,143,146],"xmlns:mml=\"http://www.w3.org/1998/Math/MathML\"":[76,79,82,103,135,141,144,147],"xmlns:xlink=\"http://www.w3.org/1999/xlink\">O(K</sup>":[77],"xmlns:xlink=\"http://www.w3.org/1999/xlink\">p</sup>":[80,104,136,145],"xmlns:xlink=\"http://www.w3.org/1999/xlink\">(x)-K(x)+log(|x|))</sup>":[83],"inputs":[86],"x.":[87],"where":[88],"K(x)":[89],"Kolmogorov":[92,131],"complexity":[93],"(size":[94],"smallest":[96,111],"program":[97,112],"generating":[98,113],"x)":[99],"and":[100],"K":[101],"(x)":[105,137],"size":[108],"x":[114],"within":[115],"p(|x|).":[117],"To":[118],"prove":[119],"this":[120],"result":[121],"that,":[124],"under":[125],"assumption,":[128],"distribution,":[132],"m":[133],"=":[138],"xmlns:xlink=\"http://www.w3.org/1999/xlink\">-K</sup>":[142],"xmlns:xlink=\"http://www.w3.org/1999/xlink\">(x)</sup>":[148],",":[149],"universal":[151],"among":[152]},"counts_by_year":[{"year":2025,"cited_by_count":1},{"year":2024,"cited_by_count":2},{"year":2023,"cited_by_count":4},{"year":2022,"cited_by_count":2},{"year":2021,"cited_by_count":1},{"year":2020,"cited_by_count":1},{"year":2018,"cited_by_count":1},{"year":2014,"cited_by_count":1},{"year":2013,"cited_by_count":1},{"year":2012,"cited_by_count":1}],"updated_date":"2026-04-05T17:49:38.594831","created_date":"2025-10-10T00:00:00"}