{"id":"https://openalex.org/W4376651368","doi":"https://doi.org/10.1145/3564246.3585124","title":"Upper and Lower Bounds on the Smoothed Complexity of the Simplex Method","display_name":"Upper and Lower Bounds on the Smoothed Complexity of the Simplex Method","publication_year":2023,"publication_date":"2023-05-16","ids":{"openalex":"https://openalex.org/W4376651368","doi":"https://doi.org/10.1145/3564246.3585124"},"language":"en","primary_location":{"id":"doi:10.1145/3564246.3585124","is_oa":false,"landing_page_url":"https://doi.org/10.1145/3564246.3585124","pdf_url":null,"source":null,"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"Proceedings of the 55th 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/A5034599189","display_name":"Sophie Huiberts","orcid":"https://orcid.org/0000-0003-2633-014X"},"institutions":[{"id":"https://openalex.org/I78577930","display_name":"Columbia University","ror":"https://ror.org/00hj8s172","country_code":"US","type":"education","lineage":["https://openalex.org/I78577930"]}],"countries":["US"],"is_corresponding":true,"raw_author_name":"Sophie Huiberts","raw_affiliation_strings":["Columbia University, USA"],"affiliations":[{"raw_affiliation_string":"Columbia University, USA","institution_ids":["https://openalex.org/I78577930"]}]},{"author_position":"middle","author":{"id":"https://openalex.org/A5024980585","display_name":"Yin Tat Lee","orcid":null},"institutions":[{"id":"https://openalex.org/I1290206253","display_name":"Microsoft (United States)","ror":"https://ror.org/00d0nc645","country_code":"US","type":"company","lineage":["https://openalex.org/I1290206253"]}],"countries":["US"],"is_corresponding":false,"raw_author_name":"Yin Tat Lee","raw_affiliation_strings":["Microsoft Research, USA"],"affiliations":[{"raw_affiliation_string":"Microsoft Research, USA","institution_ids":["https://openalex.org/I1290206253"]}]},{"author_position":"last","author":{"id":"https://openalex.org/A5101780776","display_name":"Xinzhi Zhang","orcid":"https://orcid.org/0000-0003-3479-9327"},"institutions":[{"id":"https://openalex.org/I201448701","display_name":"University of Washington","ror":"https://ror.org/00cvxb145","country_code":"US","type":"education","lineage":["https://openalex.org/I201448701"]}],"countries":["US"],"is_corresponding":false,"raw_author_name":"Xinzhi Zhang","raw_affiliation_strings":["University of Washington, USA"],"affiliations":[{"raw_affiliation_string":"University of Washington, USA","institution_ids":["https://openalex.org/I201448701"]}]}],"institutions":[],"countries_distinct_count":1,"institutions_distinct_count":3,"corresponding_author_ids":["https://openalex.org/A5034599189"],"corresponding_institution_ids":["https://openalex.org/I78577930"],"apc_list":null,"apc_paid":null,"fwci":2.8831,"has_fulltext":false,"cited_by_count":7,"citation_normalized_percentile":{"value":0.8952381,"is_in_top_1_percent":false,"is_in_top_10_percent":false},"cited_by_percentile_year":{"min":89,"max":100},"biblio":{"volume":null,"issue":null,"first_page":"1904","last_page":"1917"},"is_retracted":false,"is_paratext":false,"is_xpac":false,"primary_topic":{"id":"https://openalex.org/T10963","display_name":"Advanced Optimization Algorithms Research","score":0.9998000264167786,"subfield":{"id":"https://openalex.org/subfields/2612","display_name":"Numerical Analysis"},"field":{"id":"https://openalex.org/fields/26","display_name":"Mathematics"},"domain":{"id":"https://openalex.org/domains/3","display_name":"Physical Sciences"}},"topics":[{"id":"https://openalex.org/T10963","display_name":"Advanced Optimization Algorithms Research","score":0.9998000264167786,"subfield":{"id":"https://openalex.org/subfields/2612","display_name":"Numerical Analysis"},"field":{"id":"https://openalex.org/fields/26","display_name":"Mathematics"},"domain":{"id":"https://openalex.org/domains/3","display_name":"Physical Sciences"}},{"id":"https://openalex.org/T10792","display_name":"Matrix Theory and Algorithms","score":0.9988999962806702,"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/T11435","display_name":"Polynomial and algebraic computation","score":0.9980000257492065,"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"}}],"keywords":[{"id":"https://openalex.org/keywords/upper-and-lower-bounds","display_name":"Upper and lower bounds","score":0.6273849010467529},{"id":"https://openalex.org/keywords/simplex","display_name":"Simplex","score":0.6001132726669312},{"id":"https://openalex.org/keywords/computer-science","display_name":"Computer science","score":0.5312362313270569},{"id":"https://openalex.org/keywords/computational-complexity-theory","display_name":"Computational complexity theory","score":0.5169881582260132},{"id":"https://openalex.org/keywords/algorithm","display_name":"Algorithm","score":0.43006905913352966},{"id":"https://openalex.org/keywords/mathematical-optimization","display_name":"Mathematical optimization","score":0.39381295442581177},{"id":"https://openalex.org/keywords/mathematics","display_name":"Mathematics","score":0.3832952082157135},{"id":"https://openalex.org/keywords/combinatorics","display_name":"Combinatorics","score":0.20305657386779785},{"id":"https://openalex.org/keywords/mathematical-analysis","display_name":"Mathematical analysis","score":0.09359043836593628}],"concepts":[{"id":"https://openalex.org/C77553402","wikidata":"https://www.wikidata.org/wiki/Q13222579","display_name":"Upper and lower bounds","level":2,"score":0.6273849010467529},{"id":"https://openalex.org/C62438384","wikidata":"https://www.wikidata.org/wiki/Q331350","display_name":"Simplex","level":2,"score":0.6001132726669312},{"id":"https://openalex.org/C41008148","wikidata":"https://www.wikidata.org/wiki/Q21198","display_name":"Computer science","level":0,"score":0.5312362313270569},{"id":"https://openalex.org/C179799912","wikidata":"https://www.wikidata.org/wiki/Q205084","display_name":"Computational complexity theory","level":2,"score":0.5169881582260132},{"id":"https://openalex.org/C11413529","wikidata":"https://www.wikidata.org/wiki/Q8366","display_name":"Algorithm","level":1,"score":0.43006905913352966},{"id":"https://openalex.org/C126255220","wikidata":"https://www.wikidata.org/wiki/Q141495","display_name":"Mathematical optimization","level":1,"score":0.39381295442581177},{"id":"https://openalex.org/C33923547","wikidata":"https://www.wikidata.org/wiki/Q395","display_name":"Mathematics","level":0,"score":0.3832952082157135},{"id":"https://openalex.org/C114614502","wikidata":"https://www.wikidata.org/wiki/Q76592","display_name":"Combinatorics","level":1,"score":0.20305657386779785},{"id":"https://openalex.org/C134306372","wikidata":"https://www.wikidata.org/wiki/Q7754","display_name":"Mathematical analysis","level":1,"score":0.09359043836593628}],"mesh":[],"locations_count":1,"locations":[{"id":"doi:10.1145/3564246.3585124","is_oa":false,"landing_page_url":"https://doi.org/10.1145/3564246.3585124","pdf_url":null,"source":null,"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"Proceedings of the 55th Annual ACM Symposium on Theory of Computing","raw_type":"proceedings-article"}],"best_oa_location":null,"sustainable_development_goals":[],"awards":[],"funders":[],"has_content":{"grobid_xml":false,"pdf":false},"content_urls":null,"referenced_works_count":34,"referenced_works":["https://openalex.org/W102721416","https://openalex.org/W186942940","https://openalex.org/W288922220","https://openalex.org/W565214016","https://openalex.org/W1524198677","https://openalex.org/W1547842568","https://openalex.org/W1571051474","https://openalex.org/W1981732464","https://openalex.org/W1993541808","https://openalex.org/W1993970450","https://openalex.org/W2002273082","https://openalex.org/W2014528086","https://openalex.org/W2021495277","https://openalex.org/W2022121413","https://openalex.org/W2034053794","https://openalex.org/W2044618353","https://openalex.org/W2056940310","https://openalex.org/W2079737176","https://openalex.org/W2080654168","https://openalex.org/W2095007759","https://openalex.org/W2107395148","https://openalex.org/W2109237987","https://openalex.org/W2117081489","https://openalex.org/W2147053028","https://openalex.org/W2210909341","https://openalex.org/W2235983888","https://openalex.org/W2985441210","https://openalex.org/W2987042746","https://openalex.org/W3042397111","https://openalex.org/W3094140778","https://openalex.org/W4210963413","https://openalex.org/W4230369043","https://openalex.org/W4240142617","https://openalex.org/W6634175102"],"related_works":["https://openalex.org/W2051487156","https://openalex.org/W2073681303","https://openalex.org/W2063021680","https://openalex.org/W2357922472","https://openalex.org/W2384278689","https://openalex.org/W2563365141","https://openalex.org/W2386777115","https://openalex.org/W2053286651","https://openalex.org/W2888513445","https://openalex.org/W2189341500"],"abstract_inverted_index":{"The":[0,27],"simplex":[1,83],"method":[2,84,129],"for":[3,40],"linear":[4,50],"programming":[5],"is":[6,22,69,85],"known":[7],"to":[8,71,95,114,130],"be":[9],"highly":[10],"efficient":[11],"in":[12],"practice,":[13],"and":[14,36,55],"understanding":[15],"its":[16],"performance":[17],"from":[18],"a":[19,49,106,132],"theoretical":[20],"perspective":[21],"an":[23],"active":[24],"research":[25],"topic.":[26],"framework":[28],"of":[29,47,66,81,99,109,122,141],"smoothed":[30,45,79,139],"analysis,":[31],"first":[32],"introduced":[33],"by":[34],"Spielman":[35],"Teng":[37],"(JACM":[38],"\u201904)":[39],"this":[41,104],"purpose,":[42],"defines":[43],"the":[44,59,72,78,82,90,96,110,120,138],"complexity":[46,80,140],"solving":[48],"program":[51],"with":[52],"d":[53],"variables":[54],"n":[56],"constraints":[57],"as":[58,117],"expected":[60],"running":[61],"time":[62],"when":[63],"Gaussian":[64],"noise":[65],"variance":[67],"\u03c32":[68],"added":[70],"LP":[73],"data.":[74],"We":[75,102],"prove":[76,131],"that":[77],"O(\u03c3\u22123/2":[86],"d13/4log7/4":[87],"n),":[88],"improving":[89],"dependence":[91],"on":[92,137],"1/\u03c3":[93],"compared":[94],"previous":[97],"bound":[98,136],"O(\u03c3\u22122":[100],"d2\u221alogn).":[101],"accomplish":[103],"through":[105],"new":[107,124],"analysis":[108],"shadow":[111],"bound,":[112],"key":[113],"earlier":[115],"analyses":[116],"well.":[118],"Illustrating":[119],"power":[121],"our":[123,128],"method,":[125],"we":[126],"use":[127],"nearly":[133],"tight":[134],"upper":[135],"two-dimensional":[142],"polygons.":[143]},"counts_by_year":[{"year":2026,"cited_by_count":2},{"year":2025,"cited_by_count":2},{"year":2024,"cited_by_count":2},{"year":2023,"cited_by_count":1}],"updated_date":"2025-11-06T03:46:38.306776","created_date":"2025-10-10T00:00:00"}