{"id":"https://openalex.org/W4415210372","doi":"https://doi.org/10.46298/theoretics.25.23","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":2025,"publication_date":"2025-10-15","ids":{"openalex":"https://openalex.org/W4415210372","doi":"https://doi.org/10.46298/theoretics.25.23"},"language":"en","primary_location":{"id":"doi:10.46298/theoretics.25.23","is_oa":true,"landing_page_url":"https://doi.org/10.46298/theoretics.25.23","pdf_url":"https://theoretics.episciences.org/16712/pdf","source":{"id":"https://openalex.org/S4387285734","display_name":"TheoretiCS","issn_l":"2751-4838","issn":["2751-4838"],"is_oa":true,"is_in_doaj":true,"is_core":true,"host_organization":null,"host_organization_name":null,"host_organization_lineage":[],"host_organization_lineage_names":[],"type":"journal"},"license":"cc-by","license_id":"https://openalex.org/licenses/cc-by","version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"TheoretiCS","raw_type":"journal-article"},"type":"article","indexed_in":["crossref","doaj"],"open_access":{"is_oa":true,"oa_status":"diamond","oa_url":"https://theoretics.episciences.org/16712/pdf","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":[],"countries":[],"is_corresponding":false,"raw_author_name":"Sophie Huiberts","raw_affiliation_strings":[],"raw_orcid":"https://orcid.org/0000-0003-2633-014X","affiliations":[]},{"author_position":"middle","author":{"id":"https://openalex.org/A5024980585","display_name":"Yin Tat Lee","orcid":null},"institutions":[],"countries":[],"is_corresponding":false,"raw_author_name":"Yin Tat Lee","raw_affiliation_strings":[],"raw_orcid":null,"affiliations":[]},{"author_position":"last","author":{"id":"https://openalex.org/A5101780776","display_name":"Xinzhi Zhang","orcid":"https://orcid.org/0000-0003-3479-9327"},"institutions":[],"countries":[],"is_corresponding":false,"raw_author_name":"Xinzhi Zhang","raw_affiliation_strings":[],"raw_orcid":null,"affiliations":[]}],"institutions":[],"countries_distinct_count":0,"institutions_distinct_count":0,"corresponding_author_ids":[],"corresponding_institution_ids":[],"apc_list":null,"apc_paid":null,"fwci":1.6919,"has_fulltext":true,"cited_by_count":1,"citation_normalized_percentile":{"value":0.85505592,"is_in_top_1_percent":false,"is_in_top_10_percent":false},"cited_by_percentile_year":{"min":94,"max":97},"biblio":{"volume":"Volume 4","issue":null,"first_page":null,"last_page":null},"is_retracted":false,"is_paratext":false,"is_xpac":false,"primary_topic":{"id":"https://openalex.org/T10963","display_name":"Advanced Optimization Algorithms Research","score":0.9947999715805054,"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.9947999715805054,"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.9929999709129333,"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.9631999731063843,"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/simplex-algorithm","display_name":"Simplex algorithm","score":0.7031000256538391},{"id":"https://openalex.org/keywords/simplex","display_name":"Simplex","score":0.6442999839782715},{"id":"https://openalex.org/keywords/upper-and-lower-bounds","display_name":"Upper and lower bounds","score":0.636900007724762},{"id":"https://openalex.org/keywords/linear-programming","display_name":"Linear programming","score":0.6046000123023987},{"id":"https://openalex.org/keywords/key","display_name":"Key (lock)","score":0.421099990606308},{"id":"https://openalex.org/keywords/vertex","display_name":"Vertex (graph theory)","score":0.40119999647140503},{"id":"https://openalex.org/keywords/computational-complexity-theory","display_name":"Computational complexity theory","score":0.38929998874664307},{"id":"https://openalex.org/keywords/perspective","display_name":"Perspective (graphical)","score":0.3400999903678894}],"concepts":[{"id":"https://openalex.org/C144521790","wikidata":"https://www.wikidata.org/wiki/Q134164","display_name":"Simplex algorithm","level":3,"score":0.7031000256538391},{"id":"https://openalex.org/C62438384","wikidata":"https://www.wikidata.org/wiki/Q331350","display_name":"Simplex","level":2,"score":0.6442999839782715},{"id":"https://openalex.org/C33923547","wikidata":"https://www.wikidata.org/wiki/Q395","display_name":"Mathematics","level":0,"score":0.6403999924659729},{"id":"https://openalex.org/C77553402","wikidata":"https://www.wikidata.org/wiki/Q13222579","display_name":"Upper and lower bounds","level":2,"score":0.636900007724762},{"id":"https://openalex.org/C41045048","wikidata":"https://www.wikidata.org/wiki/Q202843","display_name":"Linear programming","level":2,"score":0.6046000123023987},{"id":"https://openalex.org/C26517878","wikidata":"https://www.wikidata.org/wiki/Q228039","display_name":"Key (lock)","level":2,"score":0.421099990606308},{"id":"https://openalex.org/C126255220","wikidata":"https://www.wikidata.org/wiki/Q141495","display_name":"Mathematical optimization","level":1,"score":0.42100000381469727},{"id":"https://openalex.org/C80899671","wikidata":"https://www.wikidata.org/wiki/Q1304193","display_name":"Vertex (graph theory)","level":3,"score":0.40119999647140503},{"id":"https://openalex.org/C179799912","wikidata":"https://www.wikidata.org/wiki/Q205084","display_name":"Computational complexity theory","level":2,"score":0.38929998874664307},{"id":"https://openalex.org/C11413529","wikidata":"https://www.wikidata.org/wiki/Q8366","display_name":"Algorithm","level":1,"score":0.3824000060558319},{"id":"https://openalex.org/C12713177","wikidata":"https://www.wikidata.org/wiki/Q1900281","display_name":"Perspective (graphical)","level":2,"score":0.3400999903678894},{"id":"https://openalex.org/C196083921","wikidata":"https://www.wikidata.org/wiki/Q7915758","display_name":"Variance (accounting)","level":2,"score":0.33469998836517334},{"id":"https://openalex.org/C311688","wikidata":"https://www.wikidata.org/wiki/Q2393193","display_name":"Time complexity","level":2,"score":0.32170000672340393},{"id":"https://openalex.org/C163716315","wikidata":"https://www.wikidata.org/wiki/Q901177","display_name":"Gaussian","level":2,"score":0.3176000118255615},{"id":"https://openalex.org/C28826006","wikidata":"https://www.wikidata.org/wiki/Q33521","display_name":"Applied mathematics","level":1,"score":0.3172000050544739},{"id":"https://openalex.org/C114614502","wikidata":"https://www.wikidata.org/wiki/Q76592","display_name":"Combinatorics","level":1,"score":0.296099990606308},{"id":"https://openalex.org/C48753275","wikidata":"https://www.wikidata.org/wiki/Q11216","display_name":"Numerical analysis","level":2,"score":0.29420000314712524},{"id":"https://openalex.org/C99498987","wikidata":"https://www.wikidata.org/wiki/Q2210247","display_name":"Noise (video)","level":3,"score":0.28380000591278076},{"id":"https://openalex.org/C118615104","wikidata":"https://www.wikidata.org/wiki/Q121416","display_name":"Discrete mathematics","level":1,"score":0.28279998898506165},{"id":"https://openalex.org/C112313634","wikidata":"https://www.wikidata.org/wiki/Q7886648","display_name":"Complement (music)","level":5,"score":0.2773999869823456},{"id":"https://openalex.org/C2778334786","wikidata":"https://www.wikidata.org/wiki/Q1586270","display_name":"Variation (astronomy)","level":2,"score":0.27059999108314514},{"id":"https://openalex.org/C191157680","wikidata":"https://www.wikidata.org/wiki/Q17085895","display_name":"Revised simplex method","level":4,"score":0.2615000009536743}],"mesh":[],"locations_count":2,"locations":[{"id":"doi:10.46298/theoretics.25.23","is_oa":true,"landing_page_url":"https://doi.org/10.46298/theoretics.25.23","pdf_url":"https://theoretics.episciences.org/16712/pdf","source":{"id":"https://openalex.org/S4387285734","display_name":"TheoretiCS","issn_l":"2751-4838","issn":["2751-4838"],"is_oa":true,"is_in_doaj":true,"is_core":true,"host_organization":null,"host_organization_name":null,"host_organization_lineage":[],"host_organization_lineage_names":[],"type":"journal"},"license":"cc-by","license_id":"https://openalex.org/licenses/cc-by","version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"TheoretiCS","raw_type":"journal-article"},{"id":"pmh:oai:doaj.org/article:07c7a585eca140d29e5e7528dd275939","is_oa":false,"landing_page_url":"https://doaj.org/article/07c7a585eca140d29e5e7528dd275939","pdf_url":null,"source":{"id":"https://openalex.org/S4306401280","display_name":"DOAJ (DOAJ: Directory of Open Access Journals)","issn_l":null,"issn":null,"is_oa":false,"is_in_doaj":false,"is_core":false,"host_organization":null,"host_organization_name":null,"host_organization_lineage":[],"host_organization_lineage_names":[],"type":"repository"},"license":null,"license_id":null,"version":"submittedVersion","is_accepted":false,"is_published":false,"raw_source_name":"TheoretiCS, Vol Volume 4 (2025)","raw_type":"article"}],"best_oa_location":{"id":"doi:10.46298/theoretics.25.23","is_oa":true,"landing_page_url":"https://doi.org/10.46298/theoretics.25.23","pdf_url":"https://theoretics.episciences.org/16712/pdf","source":{"id":"https://openalex.org/S4387285734","display_name":"TheoretiCS","issn_l":"2751-4838","issn":["2751-4838"],"is_oa":true,"is_in_doaj":true,"is_core":true,"host_organization":null,"host_organization_name":null,"host_organization_lineage":[],"host_organization_lineage_names":[],"type":"journal"},"license":"cc-by","license_id":"https://openalex.org/licenses/cc-by","version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"TheoretiCS","raw_type":"journal-article"},"sustainable_development_goals":[],"awards":[{"id":"https://openalex.org/G1225180920","display_name":"Towards Testable Theories of Linear Programming","funder_award_id":"ANR-24-CE48-2762","funder_id":"https://openalex.org/F4320320883","funder_display_name":"Agence Nationale de la Recherche"},{"id":"https://openalex.org/G5712563980","display_name":"AF: SMALL : Algorithmic and Game Theoretic Problems Arising in Modern Matching Markets","funder_award_id":"1813135","funder_id":"https://openalex.org/F4320306076","funder_display_name":"National Science Foundation"},{"id":"https://openalex.org/G6671297155","display_name":null,"funder_award_id":"CAREER","funder_id":"https://openalex.org/F4320306076","funder_display_name":"National Science Foundation"}],"funders":[{"id":"https://openalex.org/F4320306076","display_name":"National Science Foundation","ror":"https://ror.org/021nxhr62"},{"id":"https://openalex.org/F4320320883","display_name":"Agence Nationale de la Recherche","ror":"https://ror.org/00rbzpz17"}],"has_content":{"pdf":true,"grobid_xml":false},"content_urls":{"pdf":"https://content.openalex.org/works/W4415210372.pdf"},"referenced_works_count":0,"referenced_works":[],"related_works":[],"abstract_inverted_index":{"The":[0,27],"simplex":[1,83,159,166],"method":[2,84,130],"for":[3,40,196],"linear":[4,50],"programming":[5],"is":[6,22,69,85,188,217],"known":[7],"to":[8,71,95,115,131],"be":[9,211],"highly":[10],"efficient":[11],"in":[12],"practice,":[13],"and":[14,36,55],"understanding":[15],"its":[16],"performance":[17],"from":[18],"a":[19,49,107,133,189,203],"theoretical":[20],"perspective":[21],"an":[23],"active":[24],"research":[25],"topic.":[26],"framework":[28],"of":[29,47,66,81,99,110,123,142,157,185],"smoothed":[30,45,79,140,155],"analysis,":[31],"first":[32,149],"introduced":[33],"by":[34],"Spielman":[35],"Teng":[37],"(JACM":[38],"'04)":[39],"this":[41,105,208],"purpose,":[42],"defines":[43],"the":[44,59,72,78,82,90,96,111,121,139,148,154,158,163,193,197,218],"complexity":[46,80,141,156],"solving":[48],"program":[51],"with":[52,179,202],"$d$":[53],"variables":[54],"$n$":[56],"constraints":[57],"as":[58,118],"expected":[60],"running":[61],"time":[62],"when":[63],"Gaussian":[64],"noise":[65],"variance":[67],"$\u03c3^2$":[68],"added":[70],"LP":[73],"data.":[74],"We":[75,103,145,200],"prove":[76,132],"that":[77,162,206],"$O(\u03c3^{-3/2}":[86],"d^{13/4}\\log^{7/4}":[87],"n)$,":[88],"improving":[89],"dependence":[91],"on":[92,138,153,192],"$1/\u03c3$":[93],"compared":[94],"previous":[97],"bound":[98,137,152],"$O(\u03c3^{-2}":[100],"d^2\\sqrt{\\log":[101],"n})$.":[102],"accomplish":[104],"through":[106],"new":[108,125,190],"analysis":[109,187,209],"\\emph{shadow":[112,164],"bound},":[113],"key":[114,183],"earlier":[116],"analyses":[117],"well.":[119],"Illustrating":[120],"power":[122],"our":[124,129,186],"method,":[126,160],"we":[127],"use":[128],"nearly":[134],"tight":[135],"upper":[136],"two-dimensional":[143],"polygons.":[144],"also":[146],"establish":[147],"non-trivial":[150],"lower":[151],"proving":[161],"vertex":[165],"method}":[167],"requires":[168],"at":[169],"least":[170],"$\u03a9\\Big(\\min":[171],"\\big(\u03c3^{-1/2}":[172],"d^{-1/2}\\log^{-1/4}":[173],"d,2^d":[174],"\\big)":[175],"\\Big)$":[176],"pivot":[177],"steps":[178],"high":[180],"probability.":[181],"A":[182],"part":[184],"variation":[191],"extended":[194],"formulation":[195],"regular":[198],"$2^k$-gon.":[199],"end":[201],"numerical":[204],"experiment":[205],"suggests":[207],"could":[210],"further":[212],"improved.":[213],"56":[214],"pages.":[215],"This":[216],"TheoretiCS":[219],"journal":[220],"version":[221]},"counts_by_year":[{"year":2026,"cited_by_count":1}],"updated_date":"2026-05-21T06:26:12.895304","created_date":"2025-10-16T00:00:00"}