{"id":"https://openalex.org/W2061874298","doi":"https://doi.org/10.1145/2746539.2746558","title":"The Complexity of the Simplex Method","display_name":"The Complexity of the Simplex Method","publication_year":2015,"publication_date":"2015-06-03","ids":{"openalex":"https://openalex.org/W2061874298","doi":"https://doi.org/10.1145/2746539.2746558","mag":"2061874298"},"language":"en","primary_location":{"id":"doi:10.1145/2746539.2746558","is_oa":false,"landing_page_url":"https://doi.org/10.1145/2746539.2746558","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-seventh 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/A5029623300","display_name":"John Fearnley","orcid":"https://orcid.org/0000-0003-0791-4342"},"institutions":[{"id":"https://openalex.org/I146655781","display_name":"University of Liverpool","ror":"https://ror.org/04xs57h96","country_code":"GB","type":"education","lineage":["https://openalex.org/I146655781"]}],"countries":["GB"],"is_corresponding":true,"raw_author_name":"John Fearnley","raw_affiliation_strings":["University of Liverpool, Liverpool, United Kingdom","University of Liverpool, Liverpool, United Kingdom,"],"affiliations":[{"raw_affiliation_string":"University of Liverpool, Liverpool, United Kingdom","institution_ids":["https://openalex.org/I146655781"]},{"raw_affiliation_string":"University of Liverpool, Liverpool, United Kingdom,","institution_ids":["https://openalex.org/I146655781"]}]},{"author_position":"last","author":{"id":"https://openalex.org/A5084692264","display_name":"Rahul Savani","orcid":"https://orcid.org/0000-0003-1262-7831"},"institutions":[{"id":"https://openalex.org/I146655781","display_name":"University of Liverpool","ror":"https://ror.org/04xs57h96","country_code":"GB","type":"education","lineage":["https://openalex.org/I146655781"]}],"countries":["GB"],"is_corresponding":false,"raw_author_name":"Rahul Savani","raw_affiliation_strings":["University of Liverpool, Liverpool, United Kingdom","University of Liverpool, Liverpool, United Kingdom,"],"affiliations":[{"raw_affiliation_string":"University of Liverpool, Liverpool, United Kingdom","institution_ids":["https://openalex.org/I146655781"]},{"raw_affiliation_string":"University of Liverpool, Liverpool, United Kingdom,","institution_ids":["https://openalex.org/I146655781"]}]}],"institutions":[],"countries_distinct_count":1,"institutions_distinct_count":2,"corresponding_author_ids":["https://openalex.org/A5029623300"],"corresponding_institution_ids":["https://openalex.org/I146655781"],"apc_list":null,"apc_paid":null,"fwci":6.6771,"has_fulltext":false,"cited_by_count":41,"citation_normalized_percentile":{"value":0.96713864,"is_in_top_1_percent":false,"is_in_top_10_percent":true},"cited_by_percentile_year":{"min":94,"max":99},"biblio":{"volume":null,"issue":null,"first_page":"201","last_page":"208"},"is_retracted":false,"is_paratext":false,"is_xpac":false,"primary_topic":{"id":"https://openalex.org/T10462","display_name":"Reinforcement Learning in Robotics","score":0.9988999962806702,"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"}},"topics":[{"id":"https://openalex.org/T10462","display_name":"Reinforcement Learning in Robotics","score":0.9988999962806702,"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/T10142","display_name":"Formal Methods in Verification","score":0.9966999888420105,"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/T11031","display_name":"Game Theory and Applications","score":0.9901000261306763,"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"}}],"keywords":[{"id":"https://openalex.org/keywords/revised-simplex-method","display_name":"Revised simplex method","score":0.7864119410514832},{"id":"https://openalex.org/keywords/simplex-algorithm","display_name":"Simplex algorithm","score":0.7480313777923584},{"id":"https://openalex.org/keywords/markov-decision-process","display_name":"Markov decision process","score":0.6428836584091187},{"id":"https://openalex.org/keywords/mathematics","display_name":"Mathematics","score":0.6378929615020752},{"id":"https://openalex.org/keywords/linear-programming","display_name":"Linear programming","score":0.6320441961288452},{"id":"https://openalex.org/keywords/mathematical-optimization","display_name":"Mathematical optimization","score":0.5807333588600159},{"id":"https://openalex.org/keywords/simplex","display_name":"Simplex","score":0.545689582824707},{"id":"https://openalex.org/keywords/pspace","display_name":"PSPACE","score":0.534159779548645},{"id":"https://openalex.org/keywords/basis","display_name":"Basis (linear algebra)","score":0.49565184116363525},{"id":"https://openalex.org/keywords/equivalence","display_name":"Equivalence (formal languages)","score":0.45972368121147156},{"id":"https://openalex.org/keywords/variable","display_name":"Variable (mathematics)","score":0.4337460398674011},{"id":"https://openalex.org/keywords/computational-complexity-theory","display_name":"Computational complexity theory","score":0.328305184841156},{"id":"https://openalex.org/keywords/discrete-mathematics","display_name":"Discrete mathematics","score":0.32365289330482483},{"id":"https://openalex.org/keywords/combinatorics","display_name":"Combinatorics","score":0.2950410842895508},{"id":"https://openalex.org/keywords/algorithm","display_name":"Algorithm","score":0.25629374384880066},{"id":"https://openalex.org/keywords/markov-process","display_name":"Markov process","score":0.2520591914653778},{"id":"https://openalex.org/keywords/statistics","display_name":"Statistics","score":0.06686747074127197}],"concepts":[{"id":"https://openalex.org/C191157680","wikidata":"https://www.wikidata.org/wiki/Q17085895","display_name":"Revised simplex method","level":4,"score":0.7864119410514832},{"id":"https://openalex.org/C144521790","wikidata":"https://www.wikidata.org/wiki/Q134164","display_name":"Simplex algorithm","level":3,"score":0.7480313777923584},{"id":"https://openalex.org/C106189395","wikidata":"https://www.wikidata.org/wiki/Q176789","display_name":"Markov decision process","level":3,"score":0.6428836584091187},{"id":"https://openalex.org/C33923547","wikidata":"https://www.wikidata.org/wiki/Q395","display_name":"Mathematics","level":0,"score":0.6378929615020752},{"id":"https://openalex.org/C41045048","wikidata":"https://www.wikidata.org/wiki/Q202843","display_name":"Linear programming","level":2,"score":0.6320441961288452},{"id":"https://openalex.org/C126255220","wikidata":"https://www.wikidata.org/wiki/Q141495","display_name":"Mathematical optimization","level":1,"score":0.5807333588600159},{"id":"https://openalex.org/C62438384","wikidata":"https://www.wikidata.org/wiki/Q331350","display_name":"Simplex","level":2,"score":0.545689582824707},{"id":"https://openalex.org/C197685441","wikidata":"https://www.wikidata.org/wiki/Q500716","display_name":"PSPACE","level":3,"score":0.534159779548645},{"id":"https://openalex.org/C12426560","wikidata":"https://www.wikidata.org/wiki/Q189569","display_name":"Basis (linear algebra)","level":2,"score":0.49565184116363525},{"id":"https://openalex.org/C2780069185","wikidata":"https://www.wikidata.org/wiki/Q7977945","display_name":"Equivalence (formal languages)","level":2,"score":0.45972368121147156},{"id":"https://openalex.org/C182365436","wikidata":"https://www.wikidata.org/wiki/Q50701","display_name":"Variable (mathematics)","level":2,"score":0.4337460398674011},{"id":"https://openalex.org/C179799912","wikidata":"https://www.wikidata.org/wiki/Q205084","display_name":"Computational complexity theory","level":2,"score":0.328305184841156},{"id":"https://openalex.org/C118615104","wikidata":"https://www.wikidata.org/wiki/Q121416","display_name":"Discrete mathematics","level":1,"score":0.32365289330482483},{"id":"https://openalex.org/C114614502","wikidata":"https://www.wikidata.org/wiki/Q76592","display_name":"Combinatorics","level":1,"score":0.2950410842895508},{"id":"https://openalex.org/C11413529","wikidata":"https://www.wikidata.org/wiki/Q8366","display_name":"Algorithm","level":1,"score":0.25629374384880066},{"id":"https://openalex.org/C159886148","wikidata":"https://www.wikidata.org/wiki/Q176645","display_name":"Markov process","level":2,"score":0.2520591914653778},{"id":"https://openalex.org/C105795698","wikidata":"https://www.wikidata.org/wiki/Q12483","display_name":"Statistics","level":1,"score":0.06686747074127197},{"id":"https://openalex.org/C134306372","wikidata":"https://www.wikidata.org/wiki/Q7754","display_name":"Mathematical analysis","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}],"mesh":[],"locations_count":1,"locations":[{"id":"doi:10.1145/2746539.2746558","is_oa":false,"landing_page_url":"https://doi.org/10.1145/2746539.2746558","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-seventh annual ACM symposium on Theory of Computing","raw_type":"proceedings-article"}],"best_oa_location":null,"sustainable_development_goals":[{"id":"https://metadata.un.org/sdg/16","display_name":"Peace, Justice and strong institutions","score":0.800000011920929}],"awards":[{"id":"https://openalex.org/G3165237670","display_name":"Algorithms for Finding Approximate Nash Equilibria","funder_award_id":"EP/L011018/1","funder_id":"https://openalex.org/F4320334627","funder_display_name":"Engineering and Physical Sciences Research Council"},{"id":"https://openalex.org/G8639667597","display_name":null,"funder_award_id":"EP/L011018/1","funder_id":"https://openalex.org/F4320334627","funder_display_name":"Engineering and Physical Sciences Research Council"}],"funders":[{"id":"https://openalex.org/F4320334627","display_name":"Engineering and Physical Sciences Research Council","ror":"https://ror.org/0439y7842"}],"has_content":{"pdf":false,"grobid_xml":false},"content_urls":null,"referenced_works_count":29,"referenced_works":["https://openalex.org/W186942940","https://openalex.org/W1567483970","https://openalex.org/W1571051474","https://openalex.org/W1852734164","https://openalex.org/W1928484725","https://openalex.org/W2002273082","https://openalex.org/W2034053794","https://openalex.org/W2040194491","https://openalex.org/W2044413922","https://openalex.org/W2057913812","https://openalex.org/W2062459871","https://openalex.org/W2067768752","https://openalex.org/W2075654027","https://openalex.org/W2103981148","https://openalex.org/W2107924392","https://openalex.org/W2109237987","https://openalex.org/W2117081489","https://openalex.org/W2119567691","https://openalex.org/W2141252092","https://openalex.org/W2162425318","https://openalex.org/W2212750940","https://openalex.org/W2334782222","https://openalex.org/W2401461584","https://openalex.org/W2796604629","https://openalex.org/W3103084350","https://openalex.org/W4300005723","https://openalex.org/W4300462944","https://openalex.org/W6678861937","https://openalex.org/W6814843278"],"related_works":["https://openalex.org/W2384679317","https://openalex.org/W1570109187","https://openalex.org/W2911215968","https://openalex.org/W2366013513","https://openalex.org/W2371263478","https://openalex.org/W2359193884","https://openalex.org/W1583787753","https://openalex.org/W2020093019","https://openalex.org/W3125083766","https://openalex.org/W2032433437"],"abstract_inverted_index":{"The":[0],"simplex":[1,19,66,84,160],"method":[2,9,85],"is":[3,73,80,107],"a":[4,23,32,100,130],"well-studied":[5],"and":[6,45,119,122,129,142],"widely-used":[7],"pivoting":[8],"for":[10,136,147,158],"solving":[11],"linear":[12,120],"programs.":[13],"When":[14],"Dantzig":[15],"originally":[16],"formulated":[17],"the":[18,30,35,56,65,77,83,105,111,159],"method,":[20],"he":[21],"gave":[22],"natural":[24,131],"pivot":[25,50,88,127],"rule":[26,51,97,128],"that":[27,48,71,79,93],"pivots":[28],"into":[29],"basis":[31,106],"variable":[33,102],"with":[34],"most":[36],"violated":[37],"reduced":[38],"cost.":[39],"In":[40],"their":[41],"seminal":[42],"work,":[43],"Klee":[44],"Minty":[46],"showed":[47],"this":[49],"takes":[52],"exponential":[53],"time":[54],"in":[55,152],"worst":[57],"case.":[58],"We":[59,109,139],"prove":[60,92],"two":[61],"main":[62,156],"results":[63,146,157],"on":[64],"method.":[67,161],"Firstly,":[68],"we":[69,91],"show":[70,144],"it":[72],"PSPACE-complete":[74],"to":[75,103],"find":[76],"solution":[78],"computed":[81],"by":[82],"using":[86],"Dantzig's":[87,96,126],"rule.":[89],"Secondly,":[90],"deciding":[94],"whether":[95],"ever":[98],"chooses":[99],"specific":[101],"enter":[104],"PSPACE-complete.":[108],"use":[110],"known":[112],"connection":[113],"between":[114,125],"Markov":[115],"decision":[116],"processes":[117],"(MDPs)":[118],"programming,":[121],"an":[123],"equivalence":[124],"variant":[132],"of":[133],"policy":[134,149],"iteration":[135],"average-reward":[137],"MDPs.":[138],"construct":[140],"MDPs":[141],"then":[143],"PSPACE-completeness":[145],"single-switch":[148],"iteration,":[150],"which":[151],"turn":[153],"imply":[154],"our":[155]},"counts_by_year":[{"year":2026,"cited_by_count":3},{"year":2025,"cited_by_count":4},{"year":2024,"cited_by_count":2},{"year":2023,"cited_by_count":4},{"year":2022,"cited_by_count":4},{"year":2021,"cited_by_count":6},{"year":2020,"cited_by_count":2},{"year":2018,"cited_by_count":7},{"year":2017,"cited_by_count":3},{"year":2016,"cited_by_count":3},{"year":2015,"cited_by_count":2}],"updated_date":"2026-04-16T08:26:57.006410","created_date":"2025-10-10T00:00:00"}