{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,4,16]],"date-time":"2026-04-16T09:58:22Z","timestamp":1776333502181,"version":"3.51.2"},"publisher-location":"New York, NY, USA","reference-count":26,"publisher":"ACM","license":[{"start":{"date-parts":[[2015,6,14]],"date-time":"2015-06-14T00:00:00Z","timestamp":1434240000000},"content-version":"vor","delay-in-days":0,"URL":"https:\/\/www.acm.org\/publications\/policies\/copyright_policy#Background"}],"funder":[{"DOI":"10.13039\/501100000266","name":"Engineering and Physical Sciences Research Council","doi-asserted-by":"publisher","award":["EP\/L011018\/1"],"award-info":[{"award-number":["EP\/L011018\/1"]}],"id":[{"id":"10.13039\/501100000266","id-type":"DOI","asserted-by":"publisher"}]}],"content-domain":{"domain":["dl.acm.org"],"crossmark-restriction":true},"short-container-title":[],"published-print":{"date-parts":[[2015,6,14]]},"DOI":"10.1145\/2746539.2746558","type":"proceedings-article","created":{"date-parts":[[2015,6,3]],"date-time":"2015-06-03T15:35:56Z","timestamp":1433345756000},"page":"201-208","update-policy":"https:\/\/doi.org\/10.1145\/crossmark-policy","source":"Crossref","is-referenced-by-count":26,"title":["The Complexity of the Simplex Method"],"prefix":"10.1145","author":[{"given":"John","family":"Fearnley","sequence":"first","affiliation":[{"name":"University of Liverpool, Liverpool, United Kingdom"}]},{"given":"Rahul","family":"Savani","sequence":"additional","affiliation":[{"name":"University of Liverpool, Liverpool, United Kingdom"}]}],"member":"320","published-online":{"date-parts":[[2015,6,14]]},"reference":[{"key":"e_1_3_2_1_1_1","doi-asserted-by":"publisher","DOI":"10.1145\/4221.4222"},{"key":"e_1_3_2_1_2_1","doi-asserted-by":"publisher","DOI":"10.1007\/978-3-319-07557-0_2"},{"key":"e_1_3_2_1_3_1","doi-asserted-by":"publisher","DOI":"10.5555\/26975"},{"key":"e_1_3_2_1_4_1","doi-asserted-by":"publisher","DOI":"10.1145\/1516512.1516516"},{"key":"e_1_3_2_1_5_1","volume-title":"Linear programming and extensions","author":"Dantzig G. B.","year":"1965","unstructured":"G. B. Dantzig . Linear programming and extensions . Princeton University Press , 1965 . G. B. Dantzig. Linear programming and extensions. Princeton University Press, 1965."},{"key":"e_1_3_2_1_6_1","volume-title":"defense of the simplex algorithm's worst-case behavior. CoRR, abs\/1311.5935","author":"Disser Y.","year":"2013","unstructured":"Y. Disser and M. Skutella . In defense of the simplex algorithm's worst-case behavior. CoRR, abs\/1311.5935 , 2013 . Y. Disser and M. Skutella. In defense of the simplex algorithm's worst-case behavior. CoRR, abs\/1311.5935, 2013."},{"key":"e_1_3_2_1_7_1","doi-asserted-by":"publisher","DOI":"10.5555\/1880999.1881059"},{"key":"e_1_3_2_1_8_1","doi-asserted-by":"publisher","DOI":"10.1109\/LICS.2009.27"},{"key":"e_1_3_2_1_9_1","volume-title":"An exponential lower bound for the latest deterministic strategy iteration algorithms. Logical Methods in Computer Science, 7(3)","author":"Friedmann O.","year":"2011","unstructured":"O. Friedmann . An exponential lower bound for the latest deterministic strategy iteration algorithms. Logical Methods in Computer Science, 7(3) , 2011 . O. Friedmann. An exponential lower bound for the latest deterministic strategy iteration algorithms. Logical Methods in Computer Science, 7(3), 2011."},{"key":"e_1_3_2_1_10_1","doi-asserted-by":"publisher","DOI":"10.5555\/2018158.2018174"},{"key":"e_1_3_2_1_11_1","doi-asserted-by":"publisher","DOI":"10.5555\/2133036.2133055"},{"key":"e_1_3_2_1_12_1","doi-asserted-by":"publisher","DOI":"10.1145\/1993636.1993675"},{"key":"e_1_3_2_1_13_1","doi-asserted-by":"publisher","DOI":"10.1145\/2465769.2465774"},{"key":"e_1_3_2_1_14_1","doi-asserted-by":"publisher","DOI":"10.5555\/2634074.2634137"},{"key":"e_1_3_2_1_15_1","doi-asserted-by":"publisher","DOI":"10.1016\/0022-0000(88)90046-3"},{"key":"e_1_3_2_1_16_1","first-page":"159","volume-title":"III","author":"Klee V.","year":"1972","unstructured":"V. Klee and G. Minty . How good is the simplex algorithm? In Inequalities , III , pages 159 -- 175 , 1972 . V. Klee and G. Minty. How good is the simplex algorithm? In Inequalities, III, pages 159--175, 1972."},{"key":"e_1_3_2_1_17_1","doi-asserted-by":"publisher","DOI":"10.1287\/ijoc.6.2.188"},{"key":"e_1_3_2_1_18_1","doi-asserted-by":"publisher","DOI":"10.1007\/978-3-642-13073-1_24"},{"key":"e_1_3_2_1_19_1","doi-asserted-by":"publisher","DOI":"10.1145\/100216.100274"},{"key":"e_1_3_2_1_20_1","doi-asserted-by":"publisher","DOI":"10.5555\/2627817.2627922"},{"key":"e_1_3_2_1_21_1","doi-asserted-by":"publisher","DOI":"10.1002\/9780470316887"},{"key":"e_1_3_2_1_22_1","doi-asserted-by":"publisher","DOI":"10.1137\/0220004"},{"key":"e_1_3_2_1_23_1","doi-asserted-by":"publisher","DOI":"10.1007\/BF02591902"},{"key":"e_1_3_2_1_24_1","doi-asserted-by":"publisher","DOI":"10.1007\/BF03025291"},{"key":"e_1_3_2_1_25_1","doi-asserted-by":"publisher","DOI":"10.1145\/990308.990310"},{"key":"e_1_3_2_1_26_1","volume-title":"Local Search in Combinatorial Optimization","author":"Yannakakis M.","year":"1997","unstructured":"M. Yannakakis . Computational complexity. In E. Aarts and J. Lenstra, editors, Local Search in Combinatorial Optimization . John Wiley , 1997 . M. Yannakakis. Computational complexity. In E. Aarts and J. Lenstra, editors, Local Search in Combinatorial Optimization. John Wiley, 1997."}],"event":{"name":"STOC '15: Symposium on Theory of Computing","location":"Portland Oregon USA","acronym":"STOC '15","sponsor":["SIGACT ACM Special Interest Group on Algorithms and Computation Theory"]},"container-title":["Proceedings of the forty-seventh annual ACM symposium on Theory of Computing"],"original-title":[],"link":[{"URL":"https:\/\/dl.acm.org\/doi\/10.1145\/2746539.2746558","content-type":"unspecified","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/dl.acm.org\/doi\/pdf\/10.1145\/2746539.2746558","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2025,6,18]],"date-time":"2025-06-18T18:56:03Z","timestamp":1750272963000},"score":1,"resource":{"primary":{"URL":"https:\/\/dl.acm.org\/doi\/10.1145\/2746539.2746558"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2015,6,14]]},"references-count":26,"alternative-id":["10.1145\/2746539.2746558","10.1145\/2746539"],"URL":"https:\/\/doi.org\/10.1145\/2746539.2746558","relation":{},"subject":[],"published":{"date-parts":[[2015,6,14]]},"assertion":[{"value":"2015-06-14","order":2,"name":"published","label":"Published","group":{"name":"publication_history","label":"Publication History"}}]}}