{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,10,7]],"date-time":"2025-10-07T08:38:35Z","timestamp":1759826315254},"reference-count":40,"publisher":"Elsevier BV","issue":"4","license":[{"start":{"date-parts":[[2003,8,1]],"date-time":"2003-08-01T00:00:00Z","timestamp":1059696000000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/www.elsevier.com\/tdm\/userlicense\/1.0\/"},{"start":{"date-parts":[[2013,7,17]],"date-time":"2013-07-17T00:00:00Z","timestamp":1374019200000},"content-version":"vor","delay-in-days":3638,"URL":"https:\/\/www.elsevier.com\/open-access\/userlicense\/1.0\/"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":["Journal of Complexity"],"published-print":{"date-parts":[[2003,8]]},"DOI":"10.1016\/s0885-064x(03)00032-3","type":"journal-article","created":{"date-parts":[[2003,5,19]],"date-time":"2003-05-19T14:04:16Z","timestamp":1053353056000},"page":"474-510","source":"Crossref","is-referenced-by-count":9,"title":["Probabilistic analysis of a differential equation for linear programming"],"prefix":"10.1016","volume":"19","author":[{"given":"Asa","family":"Ben-Hur","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Joshua","family":"Feinberg","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Shmuel","family":"Fishman","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Hava T.","family":"Siegelmann","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"78","reference":[{"key":"10.1016\/S0885-064X(03)00032-3_BIB1_1","doi-asserted-by":"crossref","first-page":"673","DOI":"10.1103\/PhysRevLett.42.673","article-title":"Scaling theory of localization","volume":"42","author":"Abrahams","year":"1979","journal-title":"Phys. Rev. Lett."},{"key":"10.1016\/S0885-064X(03)00032-3_BIB1_2","doi-asserted-by":"crossref","first-page":"3519","DOI":"10.1103\/PhysRevB.22.3519","article-title":"New method for a scaling theory of localization","volume":"22","author":"Abrahams","year":"1980","journal-title":"Phys. Rev. B"},{"key":"10.1016\/S0885-064X(03)00032-3_BIB1_3","doi-asserted-by":"crossref","first-page":"4828","DOI":"10.1103\/PhysRevB.23.4828","article-title":"New method for scaling theory of localization II Multichannel theory of a \u201cwire\u201d and possible extension to higher dimensionality","volume":"23","author":"Anderson","year":"1981","journal-title":"Phys. Rev. B"},{"key":"10.1016\/S0885-064X(03)00032-3_BIB2","series-title":"Mesoscopic Phenomena in Solids","author":"Altshuler","year":"1991"},{"key":"10.1016\/S0885-064X(03)00032-3_BIB3_1","doi-asserted-by":"crossref","first-page":"89","DOI":"10.1016\/0370-2693(91)90401-B","article-title":"Complex random surfaces","volume":"254","author":"Anderson","year":"1991","journal-title":"Phys. Lett. B"},{"key":"10.1016\/S0885-064X(03)00032-3_BIB3_2","doi-asserted-by":"crossref","first-page":"463","DOI":"10.1016\/0550-3213(91)90411-P","article-title":"Branched polymers from a double scaling limit of matrix models","volume":"360","author":"Anderson","year":"1991","journal-title":"Nucl. Phys. B"},{"key":"10.1016\/S0885-064X(03)00032-3_BIB3_3","first-page":"473","article-title":"Renormalizing rectangles and other topics in random matrix theory","volume":"87","author":"Feinberg","year":"1997","journal-title":"J. Statist. Mech."},{"key":"10.1016\/S0885-064X(03)00032-3_BIB3_4","doi-asserted-by":"crossref","first-page":"1716","DOI":"10.1063\/1.527481","article-title":"Large rectangular random matrices","volume":"28","author":"Cicuta","year":"1987","journal-title":"J. Math. Phys."},{"key":"10.1016\/S0885-064X(03)00032-3_BIB4","doi-asserted-by":"crossref","first-page":"176","DOI":"10.1287\/moor.24.1.176","article-title":"Probabilistic analysis of an infeasible interior-point algorithm for linear programming","volume":"24","author":"Anstreicher","year":"1999","journal-title":"Math. Oper. Res."},{"key":"10.1016\/S0885-064X(03)00032-3_BIB5","doi-asserted-by":"crossref","first-page":"51","DOI":"10.1006\/jcom.2001.0581","article-title":"A theory of complexity for continuous time dynamics","volume":"18","author":"Ben-Hur","year":"2002","journal-title":"J. Complexity"},{"key":"10.1016\/S0885-064X(03)00032-3_BIB6","series-title":"Advanced Mathematical Methods for Scientists and Engineers","author":"Bender","year":"1999"},{"key":"10.1016\/S0885-064X(03)00032-3_BIB7","series-title":"Complexity and Real Computation","author":"Blum","year":"1999"},{"key":"10.1016\/S0885-064X(03)00032-3_BIB8","doi-asserted-by":"crossref","unstructured":"M.S. Branicky, Analog computation with continuous ODEs, in: Proceedings of the IEEE Workshop on Physics and Computation, Dallas, TX, 1994, pp. 265\u2013274.","DOI":"10.1109\/PHYCMP.1994.363672"},{"key":"10.1016\/S0885-064X(03)00032-3_BIB9","doi-asserted-by":"crossref","first-page":"35","DOI":"10.1007\/BF01614153","article-title":"Planar diagrams","volume":"59","author":"Br\u00e9zin","year":"1978","journal-title":"Comm. Math. Phys."},{"key":"10.1016\/S0885-064X(03)00032-3_BIB10","doi-asserted-by":"crossref","first-page":"79","DOI":"10.1016\/0024-3795(91)90021-N","article-title":"Dynamical systems that sort lists, diagonalize matrices and solve linear programming problems","volume":"146","author":"Brockett","year":"1991","journal-title":"Linear Algebra Appl."},{"issue":"2","key":"10.1016\/S0885-064X(03)00032-3_BIB11","doi-asserted-by":"crossref","first-page":"182","DOI":"10.1109\/TCS.1984.1085482","article-title":"Nonlinear programming without computation","volume":"31","author":"Chua","year":"1984","journal-title":"IEEE Trans. Circuits Systems"},{"key":"10.1016\/S0885-064X(03)00032-3_BIB12","series-title":"Neural Networks for Optimization and Signal Processing","author":"Cichocki","year":"1993"},{"key":"10.1016\/S0885-064X(03)00032-3_BIB13","series-title":"Probability: Theory and Examples","author":"Durrett","year":"1996"},{"key":"10.1016\/S0885-064X(03)00032-3_BIB14","doi-asserted-by":"crossref","first-page":"135","DOI":"10.1093\/imamci\/8.2.135","article-title":"Dynamical systems which solve optimization problems with linear constraints","volume":"8","author":"Faybusovich","year":"1991","journal-title":"IMA J. Math. Control Inform."},{"key":"10.1016\/S0885-064X(03)00032-3_BIB15","unstructured":"J. Feinberg, On the universality of the probability distribution of the product B\u22121X of random matrices, arXiv:math.PR\/0204312, 2002."},{"key":"10.1016\/S0885-064X(03)00032-3_BIB16","first-page":"41","article-title":"On the distribution of solutions of systems of linear equations with random coefficients","volume":"2","author":"Girko","year":"1974","journal-title":"Theory Probab. Math. Statist."},{"key":"10.1016\/S0885-064X(03)00032-3_BIB17","series-title":"Limit Distributions for Sums of Independent Random Variables","author":"Gnedenko","year":"1954"},{"key":"10.1016\/S0885-064X(03)00032-3_BIB18","series-title":"Optimization and Dynamical Systems","author":"Helmke","year":"1994"},{"key":"10.1016\/S0885-064X(03)00032-3_BIB19","series-title":"Introduction to the Theory of Neural Computation","author":"Hertz","year":"1991"},{"key":"10.1016\/S0885-064X(03)00032-3_BIB20","doi-asserted-by":"crossref","first-page":"1251","DOI":"10.1109\/72.883412","article-title":"A recurrent neural network for nonlinear optimization with a continuously differentiable objective function and bound constraints","volume":"11","author":"Liang","year":"2000","journal-title":"IEEE Trans. Neural Networks"},{"key":"10.1016\/S0885-064X(03)00032-3_BIB21","series-title":"Analog VLSI and Neural Systems","author":"Mead","year":"1989"},{"key":"10.1016\/S0885-064X(03)00032-3_BIB22","series-title":"Random Matrices","author":"Mehta","year":"1991"},{"key":"10.1016\/S0885-064X(03)00032-3_BIB23","doi-asserted-by":"crossref","first-page":"964","DOI":"10.1287\/moor.18.4.964","article-title":"On adaptive-step primal-dual interior-point algorithms for linear programming","volume":"18","author":"Mizuno","year":"1993","journal-title":"Math. Oper. Res."},{"key":"10.1016\/S0885-064X(03)00032-3_BIB24","series-title":"Computational Complexity","author":"Papadimitriou","year":"1995"},{"issue":"3","key":"10.1016\/S0885-064X(03)00032-3_BIB25","doi-asserted-by":"crossref","first-page":"506","DOI":"10.1137\/0805026","article-title":"Incorporating condition measures into the complexity theory of linear programming","volume":"5","author":"Renegar","year":"1995","journal-title":"SIAM J. Optim."},{"key":"10.1016\/S0885-064X(03)00032-3_BIB26","series-title":"Linear Programming","author":"Saigal","year":"1995"},{"issue":"3","key":"10.1016\/S0885-064X(03)00032-3_BIB27","doi-asserted-by":"crossref","first-page":"301","DOI":"10.1287\/mnsc.33.3.301","article-title":"The efficiency of the simplex method","volume":"33","author":"Shamir","year":"1987","journal-title":"Manage. Sci."},{"key":"10.1016\/S0885-064X(03)00032-3_BIB28","doi-asserted-by":"crossref","first-page":"214","DOI":"10.1016\/S0167-2789(98)00057-8","article-title":"Computation by dynamical systems","volume":"120","author":"Siegelmann","year":"1998","journal-title":"Physica D"},{"key":"10.1016\/S0885-064X(03)00032-3_BIB29","doi-asserted-by":"crossref","first-page":"241","DOI":"10.1007\/BF02591902","article-title":"On the average number of steps in the simplex method of linear programming","volume":"27","author":"Smale","year":"1983","journal-title":"Math. Programming"},{"key":"10.1016\/S0885-064X(03)00032-3_BIB30","doi-asserted-by":"crossref","first-page":"671","DOI":"10.1287\/moor.16.4.671","article-title":"Probabilistic models for linear programming","volume":"16","author":"Todd","year":"1991","journal-title":"Math. Oper. Res."},{"key":"10.1016\/S0885-064X(03)00032-3_BIB31","doi-asserted-by":"crossref","first-page":"59","DOI":"10.1016\/0167-6377(82)90047-5","article-title":"Complexity of linear programming","volume":"1","author":"Traub","year":"1982","journal-title":"Oper. Res. Lett."},{"key":"10.1016\/S0885-064X(03)00032-3_BIB32_1","doi-asserted-by":"crossref","first-page":"75","DOI":"10.1016\/0370-1573(74)90023-4","article-title":"The renormalization group and the epsilon expansion","volume":"12","author":"Wilson","year":"1974","journal-title":"Phys. Rep."},{"key":"10.1016\/S0885-064X(03)00032-3_BIB32_2","series-title":"Scaling and Renormalization in Statistical Physics","author":"Cardy","year":"1996"},{"key":"10.1016\/S0885-064X(03)00032-3_BIB33","series-title":"Interior Point Algorithms: Theory and Analysis","author":"Ye","year":"1997"},{"key":"10.1016\/S0885-064X(03)00032-3_BIB34","doi-asserted-by":"crossref","first-page":"38","DOI":"10.1287\/moor.19.1.38","article-title":"Toward probabilistic analysis of interior-point algorithms for linear programming","volume":"19","author":"Ye","year":"1994","journal-title":"Math. Oper. Res."}],"container-title":["Journal of Complexity"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/api.elsevier.com\/content\/article\/PII:S0885064X03000323?httpAccept=text\/xml","content-type":"text\/xml","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/api.elsevier.com\/content\/article\/PII:S0885064X03000323?httpAccept=text\/plain","content-type":"text\/plain","content-version":"vor","intended-application":"text-mining"}],"deposited":{"date-parts":[[2019,3,21]],"date-time":"2019-03-21T06:50:20Z","timestamp":1553151020000},"score":1,"resource":{"primary":{"URL":"https:\/\/linkinghub.elsevier.com\/retrieve\/pii\/S0885064X03000323"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2003,8]]},"references-count":40,"journal-issue":{"issue":"4","published-print":{"date-parts":[[2003,8]]}},"alternative-id":["S0885064X03000323"],"URL":"https:\/\/doi.org\/10.1016\/s0885-064x(03)00032-3","relation":{},"ISSN":["0885-064X"],"issn-type":[{"value":"0885-064X","type":"print"}],"subject":[],"published":{"date-parts":[[2003,8]]}}}