{"id":"https://openalex.org/W186942940","doi":"https://doi.org/10.1007/978-3-642-20807-2_16","title":"A Subexponential Lower Bound for Zadeh\u2019s Pivoting Rule for Solving Linear Programs and Games","display_name":"A Subexponential Lower Bound for Zadeh\u2019s Pivoting Rule for Solving Linear Programs and Games","publication_year":2011,"publication_date":"2011-01-01","ids":{"openalex":"https://openalex.org/W186942940","doi":"https://doi.org/10.1007/978-3-642-20807-2_16","mag":"186942940"},"language":"en","primary_location":{"id":"doi:10.1007/978-3-642-20807-2_16","is_oa":false,"landing_page_url":"https://doi.org/10.1007/978-3-642-20807-2_16","pdf_url":null,"source":{"id":"https://openalex.org/S106296714","display_name":"Lecture notes in computer science","issn_l":"0302-9743","issn":["0302-9743","1611-3349"],"is_oa":false,"is_in_doaj":false,"is_core":true,"host_organization":"https://openalex.org/P4310319900","host_organization_name":"Springer Science+Business Media","host_organization_lineage":["https://openalex.org/P4310319900","https://openalex.org/P4310319965"],"host_organization_lineage_names":["Springer Science+Business Media","Springer Nature"],"type":"book series"},"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"Lecture Notes in Computer Science","raw_type":"book-chapter"},"type":"book-chapter","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/A5044839312","display_name":"Oliver Friedmann","orcid":null},"institutions":[],"countries":[],"is_corresponding":true,"raw_author_name":"Oliver Friedmann","raw_affiliation_strings":["Department of Computer Science, University of Munich, Germany","Dept. of Computer Science, University of Munich, Germany#TAB#"],"affiliations":[{"raw_affiliation_string":"Department of Computer Science, University of Munich, Germany","institution_ids":[]},{"raw_affiliation_string":"Dept. of Computer Science, University of Munich, Germany#TAB#","institution_ids":[]}]}],"institutions":[],"countries_distinct_count":0,"institutions_distinct_count":1,"corresponding_author_ids":["https://openalex.org/A5044839312"],"corresponding_institution_ids":[],"apc_list":{"value":5000,"currency":"EUR","value_usd":5392},"apc_paid":null,"fwci":16.0635,"has_fulltext":false,"cited_by_count":58,"citation_normalized_percentile":{"value":0.99349696,"is_in_top_1_percent":true,"is_in_top_10_percent":true},"cited_by_percentile_year":{"min":94,"max":99},"biblio":{"volume":null,"issue":null,"first_page":"192","last_page":"206"},"is_retracted":false,"is_paratext":false,"is_xpac":false,"primary_topic":{"id":"https://openalex.org/T12288","display_name":"Optimization and Search Problems","score":0.9994999766349792,"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"}},"topics":[{"id":"https://openalex.org/T12288","display_name":"Optimization and Search Problems","score":0.9994999766349792,"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"}},{"id":"https://openalex.org/T10462","display_name":"Reinforcement Learning in Robotics","score":0.9987000226974487,"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/T12072","display_name":"Machine Learning and Algorithms","score":0.9987000226974487,"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"}}],"keywords":[{"id":"https://openalex.org/keywords/computer-science","display_name":"Computer science","score":0.588650107383728},{"id":"https://openalex.org/keywords/upper-and-lower-bounds","display_name":"Upper and lower bounds","score":0.5677832961082458},{"id":"https://openalex.org/keywords/simplex-algorithm","display_name":"Simplex algorithm","score":0.5319904088973999},{"id":"https://openalex.org/keywords/markov-decision-process","display_name":"Markov decision process","score":0.42796629667282104},{"id":"https://openalex.org/keywords/linear-programming","display_name":"Linear programming","score":0.4209215044975281},{"id":"https://openalex.org/keywords/discrete-mathematics","display_name":"Discrete mathematics","score":0.4157879054546356},{"id":"https://openalex.org/keywords/algorithm","display_name":"Algorithm","score":0.36954858899116516},{"id":"https://openalex.org/keywords/mathematics","display_name":"Mathematics","score":0.3667250871658325},{"id":"https://openalex.org/keywords/theoretical-computer-science","display_name":"Theoretical computer science","score":0.3213156759738922},{"id":"https://openalex.org/keywords/combinatorics","display_name":"Combinatorics","score":0.32100796699523926},{"id":"https://openalex.org/keywords/markov-process","display_name":"Markov process","score":0.23733001947402954},{"id":"https://openalex.org/keywords/statistics","display_name":"Statistics","score":0.08395224809646606}],"concepts":[{"id":"https://openalex.org/C41008148","wikidata":"https://www.wikidata.org/wiki/Q21198","display_name":"Computer science","level":0,"score":0.588650107383728},{"id":"https://openalex.org/C77553402","wikidata":"https://www.wikidata.org/wiki/Q13222579","display_name":"Upper and lower bounds","level":2,"score":0.5677832961082458},{"id":"https://openalex.org/C144521790","wikidata":"https://www.wikidata.org/wiki/Q134164","display_name":"Simplex algorithm","level":3,"score":0.5319904088973999},{"id":"https://openalex.org/C106189395","wikidata":"https://www.wikidata.org/wiki/Q176789","display_name":"Markov decision process","level":3,"score":0.42796629667282104},{"id":"https://openalex.org/C41045048","wikidata":"https://www.wikidata.org/wiki/Q202843","display_name":"Linear programming","level":2,"score":0.4209215044975281},{"id":"https://openalex.org/C118615104","wikidata":"https://www.wikidata.org/wiki/Q121416","display_name":"Discrete mathematics","level":1,"score":0.4157879054546356},{"id":"https://openalex.org/C11413529","wikidata":"https://www.wikidata.org/wiki/Q8366","display_name":"Algorithm","level":1,"score":0.36954858899116516},{"id":"https://openalex.org/C33923547","wikidata":"https://www.wikidata.org/wiki/Q395","display_name":"Mathematics","level":0,"score":0.3667250871658325},{"id":"https://openalex.org/C80444323","wikidata":"https://www.wikidata.org/wiki/Q2878974","display_name":"Theoretical computer science","level":1,"score":0.3213156759738922},{"id":"https://openalex.org/C114614502","wikidata":"https://www.wikidata.org/wiki/Q76592","display_name":"Combinatorics","level":1,"score":0.32100796699523926},{"id":"https://openalex.org/C159886148","wikidata":"https://www.wikidata.org/wiki/Q176645","display_name":"Markov process","level":2,"score":0.23733001947402954},{"id":"https://openalex.org/C105795698","wikidata":"https://www.wikidata.org/wiki/Q12483","display_name":"Statistics","level":1,"score":0.08395224809646606},{"id":"https://openalex.org/C134306372","wikidata":"https://www.wikidata.org/wiki/Q7754","display_name":"Mathematical analysis","level":1,"score":0.0}],"mesh":[],"locations_count":4,"locations":[{"id":"doi:10.1007/978-3-642-20807-2_16","is_oa":false,"landing_page_url":"https://doi.org/10.1007/978-3-642-20807-2_16","pdf_url":null,"source":{"id":"https://openalex.org/S106296714","display_name":"Lecture notes in computer science","issn_l":"0302-9743","issn":["0302-9743","1611-3349"],"is_oa":false,"is_in_doaj":false,"is_core":true,"host_organization":"https://openalex.org/P4310319900","host_organization_name":"Springer Science+Business Media","host_organization_lineage":["https://openalex.org/P4310319900","https://openalex.org/P4310319965"],"host_organization_lineage_names":["Springer Science+Business Media","Springer Nature"],"type":"book series"},"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"Lecture Notes in Computer Science","raw_type":"book-chapter"},{"id":"pmh:oai:CiteSeerX.psu:10.1.1.185.2857","is_oa":false,"landing_page_url":"http://citeseerx.ist.psu.edu/viewdoc/summary?doi=10.1.1.185.2857","pdf_url":null,"source":null,"license":null,"license_id":null,"version":"submittedVersion","is_accepted":false,"is_published":false,"raw_source_name":"http://www2.tcs.ifi.lmu.de/%7Efriedman/papers/zadeh_lower_bound.pdf","raw_type":"text"},{"id":"pmh:oai:CiteSeerX.psu:10.1.1.188.6053","is_oa":false,"landing_page_url":"http://citeseerx.ist.psu.edu/viewdoc/summary?doi=10.1.1.188.6053","pdf_url":null,"source":null,"license":null,"license_id":null,"version":"submittedVersion","is_accepted":false,"is_published":false,"raw_source_name":"http://www2.tcs.ifi.lmu.de/%7Efriedman/papers/zadeh_lower_bound.pdf","raw_type":"text"},{"id":"pmh:oai:CiteSeerX.psu:10.1.1.409.5730","is_oa":false,"landing_page_url":"http://citeseerx.ist.psu.edu/viewdoc/summary?doi=10.1.1.409.5730","pdf_url":null,"source":null,"license":null,"license_id":null,"version":"submittedVersion","is_accepted":false,"is_published":false,"raw_source_name":"http://www2.tcs.ifi.lmu.de/~friedman/papers/zadeh_lower_bound.pdf","raw_type":"text"}],"best_oa_location":null,"sustainable_development_goals":[{"score":0.7599999904632568,"display_name":"Peace, Justice and strong institutions","id":"https://metadata.un.org/sdg/16"}],"awards":[],"funders":[],"has_content":{"grobid_xml":false,"pdf":false},"content_urls":null,"referenced_works_count":33,"referenced_works":["https://openalex.org/W1482244486","https://openalex.org/W1514240489","https://openalex.org/W1565851765","https://openalex.org/W1571051474","https://openalex.org/W1589421353","https://openalex.org/W1607065182","https://openalex.org/W1862519416","https://openalex.org/W1903391701","https://openalex.org/W1928484725","https://openalex.org/W1956277787","https://openalex.org/W1981423455","https://openalex.org/W2001212383","https://openalex.org/W2018756466","https://openalex.org/W2022121413","https://openalex.org/W2028145673","https://openalex.org/W2044618353","https://openalex.org/W2054252354","https://openalex.org/W2075654027","https://openalex.org/W2079716694","https://openalex.org/W2079737176","https://openalex.org/W2098432798","https://openalex.org/W2109237987","https://openalex.org/W2127470768","https://openalex.org/W2141252092","https://openalex.org/W2152479402","https://openalex.org/W2180475533","https://openalex.org/W2334782222","https://openalex.org/W2412582712","https://openalex.org/W2502103274","https://openalex.org/W3103084350","https://openalex.org/W4210953350","https://openalex.org/W4235914513","https://openalex.org/W4301216918"],"related_works":["https://openalex.org/W2133667137","https://openalex.org/W2380756614","https://openalex.org/W4283583523","https://openalex.org/W4295094535","https://openalex.org/W2371762379","https://openalex.org/W4291914418","https://openalex.org/W2977992986","https://openalex.org/W4214624958","https://openalex.org/W1600675813","https://openalex.org/W2477407501"],"abstract_inverted_index":null,"counts_by_year":[{"year":2026,"cited_by_count":1},{"year":2025,"cited_by_count":3},{"year":2023,"cited_by_count":3},{"year":2022,"cited_by_count":4},{"year":2021,"cited_by_count":2},{"year":2020,"cited_by_count":5},{"year":2019,"cited_by_count":3},{"year":2017,"cited_by_count":2},{"year":2016,"cited_by_count":6},{"year":2015,"cited_by_count":5},{"year":2014,"cited_by_count":7},{"year":2013,"cited_by_count":10},{"year":2012,"cited_by_count":5}],"updated_date":"2026-04-05T17:49:38.594831","created_date":"2025-10-10T00:00:00"}