{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,11,18]],"date-time":"2025-11-18T12:07:15Z","timestamp":1763467635766,"version":"3.41.0"},"publisher-location":"New York, NY, USA","reference-count":22,"publisher":"ACM","license":[{"start":{"date-parts":[[2004,6,13]],"date-time":"2004-06-13T00:00:00Z","timestamp":1087084800000},"content-version":"vor","delay-in-days":0,"URL":"https:\/\/www.acm.org\/publications\/policies\/copyright_policy#Background"}],"content-domain":{"domain":["dl.acm.org"],"crossmark-restriction":true},"short-container-title":[],"published-print":{"date-parts":[[2004,6,13]]},"DOI":"10.1145\/1007352.1007404","type":"proceedings-article","created":{"date-parts":[[2004,7,20]],"date-time":"2004-07-20T15:55:38Z","timestamp":1090338938000},"page":"315-320","update-policy":"https:\/\/doi.org\/10.1145\/crossmark-policy","source":"Crossref","is-referenced-by-count":18,"title":["A simple polynomial-time rescaling algorithm for solving linear programs"],"prefix":"10.1145","author":[{"given":"John","family":"Dunagan","sequence":"first","affiliation":[{"name":"Microsoft Research, Redmond, WA"}],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Santosh","family":"Vempala","sequence":"additional","affiliation":[{"name":"Massachusetts Institute of Technology, Cambridge, MA"}],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"320","published-online":{"date-parts":[[2004,6,13]]},"reference":[{"key":"e_1_3_2_1_1_1","doi-asserted-by":"publisher","DOI":"10.4153\/CJM-1954-037-2"},{"key":"e_1_3_2_1_2_1","doi-asserted-by":"publisher","DOI":"10.1145\/509907.509926"},{"key":"e_1_3_2_1_3_1","volume-title":"Proceedings of the Annual ACM-SIAM Symposium on Discrete Algorithms, 905--914","author":"Blum A.","year":"2002","unstructured":"A. Blum and J. Dunagan , Smoothed Analysis of the Perceptron Algorithm for Linear Programming , Proceedings of the Annual ACM-SIAM Symposium on Discrete Algorithms, 905--914 , 2002 .]] A. Blum and J. Dunagan, Smoothed Analysis of the Perceptron Algorithm for Linear Programming, Proceedings of the Annual ACM-SIAM Symposium on Discrete Algorithms, 905--914, 2002.]]"},{"key":"e_1_3_2_1_4_1","doi-asserted-by":"publisher","DOI":"10.1007\/PL00013833"},{"key":"e_1_3_2_1_5_1","doi-asserted-by":"publisher","DOI":"10.1145\/180139.181176"},{"key":"e_1_3_2_1_6_1","doi-asserted-by":"publisher","DOI":"10.5555\/795663.796349"},{"key":"e_1_3_2_1_7_1","doi-asserted-by":"publisher","DOI":"10.1007\/s101070100237"},{"key":"e_1_3_2_1_8_1","volume-title":"Linear Programming","author":"Chvatal V.","year":"1983","unstructured":"V. Chvatal , Linear Programming , W. H. Freeman , 1983 .]] V. Chvatal, Linear Programming, W. H. Freeman, 1983.]]"},{"key":"e_1_3_2_1_9_1","volume-title":"SIAM Conference on Optimization","author":"Dunagan J.","year":"2002","unstructured":"J. Dunagan , S. Teng , and D. A. Spielman , Smoothed Analysis of Renegar's Condition Number for Linear Programming , SIAM Conference on Optimization , 2002 .]] J. Dunagan, S. Teng, and D. A. Spielman, Smoothed Analysis of Renegar's Condition Number for Linear Programming, SIAM Conference on Optimization, 2002.]]"},{"key":"e_1_3_2_1_10_1","first-page":"441","volume-title":"H. Frenk et al. (eds. )","author":"Freund R. M.","year":"2000","unstructured":"R. M. Freund and S. Mizuno : \" Interior Point Methods: Current Status and Future Directions,\" in High Performance Optimization , H. Frenk et al. (eds. ) , Kluwer Academic Publishers , pp. 441 - 466 , 2000 .]] R. M. Freund and S. Mizuno: \"Interior Point Methods: Current Status and Future Directions,\" in High Performance Optimization, H. Frenk et al. (eds. ), Kluwer Academic Publishers, pp. 441-466, 2000.]]"},{"key":"e_1_3_2_1_11_1","doi-asserted-by":"publisher","DOI":"10.1007\/s10107990063a"},{"key":"e_1_3_2_1_12_1","volume-title":"Sixteenth Annual IEEE Conference on Computational Complexity","author":"Forster J.","year":"2001","unstructured":"J. Forster , A Linear Lower Bound on the Unbounded Error Probabilistic Communication Complexity , Sixteenth Annual IEEE Conference on Computational Complexity 2001 , http:\/\/citeseer. nj. nec. com\/forster01linear. html]] J. Forster, A Linear Lower Bound on the Unbounded Error Probabilistic Communication Complexity, Sixteenth Annual IEEE Conference on Computational Complexity 2001, http:\/\/citeseer. nj. nec. com\/forster01linear. html]]"},{"key":"e_1_3_2_1_13_1","doi-asserted-by":"crossref","DOI":"10.1007\/978-3-642-97881-4","volume-title":"Geometric algorithms and Combinatorial Optimization","author":"Grotchel L.","year":"1988","unstructured":"L. Grotchel , L. Lovasz , and A. Schrijver , Geometric algorithms and Combinatorial Optimization , Springer-Verlag , Berlin , 1988 .]] L. Grotchel, L. Lovasz, and A. Schrijver, Geometric algorithms and Combinatorial Optimization, Springer-Verlag, Berlin, 1988.]]"},{"key":"e_1_3_2_1_14_1","doi-asserted-by":"publisher","DOI":"10.1007\/BF02579150"},{"key":"e_1_3_2_1_15_1","first-page":"1093","article-title":"A polynomial algorithm in linear programming, (in Russian)","volume":"244","author":"Khachiyan L. G.","year":"1979","unstructured":"L. G. Khachiyan , A polynomial algorithm in linear programming, (in Russian) , Doklady Akedamii Nauk SSSR , 244 , 1093 -- 1096 , 1979 (English translation: Soviet Mathematics Doklady, 20, 191--194, 1979).]] L. G. Khachiyan, A polynomial algorithm in linear programming, (in Russian), Doklady Akedamii Nauk SSSR, 244, 1093--1096, 1979 (English translation: Soviet Mathematics Doklady, 20, 191--194, 1979).]]","journal-title":"Doklady Akedamii Nauk SSSR"},{"key":"e_1_3_2_1_16_1","volume-title":"Perceptrons: An introduction to computational geometry","author":"Minsky M. L.","year":"1969","unstructured":"M. L. Minsky and S. A. Papert , Perceptrons: An introduction to computational geometry , 1969 .]] M. L. Minsky and S. A. Papert, Perceptrons: An introduction to computational geometry, 1969.]]"},{"key":"e_1_3_2_1_17_1","doi-asserted-by":"publisher","DOI":"10.1137\/0805026"},{"key":"e_1_3_2_1_18_1","volume-title":"Principles of Neurodynamics","author":"Rosenblatt F.","year":"1962","unstructured":"F. Rosenblatt , Principles of Neurodynamics , Spartan Books , 1962 .]] F. Rosenblatt, Principles of Neurodynamics, Spartan Books, 1962.]]"},{"key":"e_1_3_2_1_19_1","doi-asserted-by":"publisher","DOI":"10.1137\/S0097539798340928"},{"key":"e_1_3_2_1_20_1","first-page":"473","volume-title":"Smooth Boosting and Learning with Malicious Noise. Fourteenth Annual Conference on Computational Learning Theory","author":"Servedio R.","year":"2001","unstructured":"R. Servedio , Smooth Boosting and Learning with Malicious Noise. Fourteenth Annual Conference on Computational Learning Theory , 473 - 489 , 2001 .]] R. Servedio, Smooth Boosting and Learning with Malicious Noise. Fourteenth Annual Conference on Computational Learning Theory, 473-489, 2001.]]"},{"key":"e_1_3_2_1_21_1","volume-title":"Mathematical Programming, 291--341","author":"Vaidya P. M.","year":"1996","unstructured":"P. M. Vaidya , A new algorithm for minimizing convex functions over convex sets , Mathematical Programming, 291--341 , 1996 .]] P. M. Vaidya, A new algorithm for minimizing convex functions over convex sets, Mathematical Programming, 291--341, 1996.]]"},{"key":"e_1_3_2_1_22_1","first-page":"2","article-title":"Evaluation of the information complexity of mathematical programming problems, (in Russian), Ekonomika i Matematicheskie Metody 12, 128--142, 1976 (English translation","volume":"13","author":"Yudin D. B.","year":"1976","unstructured":"D. B. Yudin and A. S. Nemirovski , Evaluation of the information complexity of mathematical programming problems, (in Russian), Ekonomika i Matematicheskie Metody 12, 128--142, 1976 (English translation : Matekon 13 , 2 , 3--45, 1976 ).]] D. B. Yudin and A. S. Nemirovski, Evaluation of the information complexity of mathematical programming problems, (in Russian), Ekonomika i Matematicheskie Metody 12, 128--142, 1976 (English translation: Matekon 13, 2, 3--45, 1976).]]","journal-title":"Matekon"}],"event":{"name":"STOC04: Symposium of Theory of Computing 2004","sponsor":["ACM Association for Computing Machinery","SIGACT ACM Special Interest Group on Algorithms and Computation Theory"],"location":"Chicago IL USA","acronym":"STOC04"},"container-title":["Proceedings of the thirty-sixth annual ACM symposium on Theory of computing"],"original-title":[],"link":[{"URL":"https:\/\/dl.acm.org\/doi\/10.1145\/1007352.1007404","content-type":"unspecified","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/dl.acm.org\/doi\/pdf\/10.1145\/1007352.1007404","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2025,6,18]],"date-time":"2025-06-18T17:23:56Z","timestamp":1750267436000},"score":1,"resource":{"primary":{"URL":"https:\/\/dl.acm.org\/doi\/10.1145\/1007352.1007404"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2004,6,13]]},"references-count":22,"alternative-id":["10.1145\/1007352.1007404","10.1145\/1007352"],"URL":"https:\/\/doi.org\/10.1145\/1007352.1007404","relation":{},"subject":[],"published":{"date-parts":[[2004,6,13]]},"assertion":[{"value":"2004-06-13","order":2,"name":"published","label":"Published","group":{"name":"publication_history","label":"Publication History"}}]}}