{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,9,19]],"date-time":"2025-09-19T06:56:42Z","timestamp":1758265002053},"reference-count":18,"publisher":"Elsevier BV","issue":"2","license":[{"start":{"date-parts":[[1989,6,1]],"date-time":"1989-06-01T00:00:00Z","timestamp":612662400000},"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":8812,"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":[[1989,6]]},"DOI":"10.1016\/0885-064x(89)90001-0","type":"journal-article","created":{"date-parts":[[2004,9,8]],"date-time":"2004-09-08T18:41:18Z","timestamp":1094668878000},"page":"119-143","source":"Crossref","is-referenced-by-count":8,"title":["Statistical complexity of the power method for markov chains"],"prefix":"10.1016","volume":"5","author":[{"given":"Paul E","family":"Wright","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"78","reference":[{"key":"10.1016\/0885-064X(89)90001-0_BIB1","doi-asserted-by":"crossref","first-page":"361","DOI":"10.1007\/BF00535260","article-title":"On the time taken by walks on finite groups to visit every state","volume":"62","author":"Aldous","year":"1983","journal-title":"Z. Wahrsch. Geb."},{"key":"10.1016\/0885-064X(89)90001-0_BIB2","article-title":"Random walks on finite groups and rapidly mixing Markov chains","volume":"XVII","author":"Aldous","year":"1982","journal-title":"S\u00e9m. Probab."},{"key":"10.1016\/0885-064X(89)90001-0_BIB3","volume":"Vol. 2","author":"Feller","year":"1966"},{"key":"10.1016\/0885-064X(89)90001-0_BIB4","series-title":"Tables of Integrals, Series and Products","author":"Gradshteyn","year":"1980"},{"key":"10.1016\/0885-064X(89)90001-0_BIB5","article-title":"Statistical Complexity of Numerical Linear Algebra","author":"Kostlan","year":"1985"},{"key":"10.1016\/0885-064X(89)90001-0_BIB6","doi-asserted-by":"crossref","first-page":"5","DOI":"10.1016\/0024-3795(81)90003-3","article-title":"Bounds for eigenvalues of certain stochastic matrices","volume":"38","author":"Landau","year":"1981","journal-title":"Linear Algebra and Appl."},{"key":"10.1016\/0885-064X(89)90001-0_BIB7","series-title":"Formulas and Theorems for the Special Functions of Mathematical Physics","author":"Magnus","year":"1966"},{"key":"10.1016\/0885-064X(89)90001-0_BIB8","series-title":"Random Matrices and the Statistical Theory of Energy Levels","author":"Mehta","year":"1967"},{"key":"10.1016\/0885-064X(89)90001-0_BIB9","series-title":"Real and Complex Analysis","author":"Rudin","year":"1974"},{"key":"10.1016\/0885-064X(89)90001-0_BIB10","series-title":"Functional Analysis","author":"Rudin","year":"1973"},{"key":"10.1016\/0885-064X(89)90001-0_BIB11","series-title":"Non-negative Matrices and Markov Chains","author":"Seneta","year":"1980"},{"key":"10.1016\/0885-064X(89)90001-0_BIB12","doi-asserted-by":"crossref","DOI":"10.24033\/asens.1486","article-title":"Computational complexity: On the geometry of polynomials, and a theory of cost","author":"Shub","year":"1985","journal-title":"Ann. Sci. \u00c9cole Norm. Sup. (4)"},{"issue":"No. 1","key":"10.1016\/0885-064X(89)90001-0_BIB13","doi-asserted-by":"crossref","first-page":"145","DOI":"10.1137\/0215011","article-title":"Computational complexity: On the geometry of polynomials and a theory of cost","volume":"15","author":"Shub","year":"1986","journal-title":"Siam J Comp."},{"key":"10.1016\/0885-064X(89)90001-0_BIB14","doi-asserted-by":"crossref","first-page":"1","DOI":"10.1090\/S0273-0979-1981-14858-8","article-title":"The fundamental theorem of algebra and complexity theory","volume":"4","author":"Smale","year":"1981","journal-title":"Bull. Amer. Math. Soc. (NS)"},{"key":"10.1016\/0885-064X(89)90001-0_BIB15","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. Prog."},{"key":"10.1016\/0885-064X(89)90001-0_BIB16","series-title":"Mathematical Programming: The State of the Art","article-title":"The problem of the average speed of the Simplex Method","author":"Smale","year":"1983"},{"key":"10.1016\/0885-064X(89)90001-0_BIB17","doi-asserted-by":"crossref","first-page":"87","DOI":"10.1090\/S0273-0979-1985-15391-1","article-title":"On the efficiency of the algorithms of analysis","volume":"13","author":"Smale","year":"1985","journal-title":"Bull. Amer. Math. Soc. (NS)"},{"key":"10.1016\/0885-064X(89)90001-0_BIB18","series-title":"A Course of Modern Analysis","author":"Whittaker","year":"1962"}],"container-title":["Journal of Complexity"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/api.elsevier.com\/content\/article\/PII:0885064X89900010?httpAccept=text\/xml","content-type":"text\/xml","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/api.elsevier.com\/content\/article\/PII:0885064X89900010?httpAccept=text\/plain","content-type":"text\/plain","content-version":"vor","intended-application":"text-mining"}],"deposited":{"date-parts":[[2019,2,4]],"date-time":"2019-02-04T01:58:19Z","timestamp":1549245499000},"score":1,"resource":{"primary":{"URL":"https:\/\/linkinghub.elsevier.com\/retrieve\/pii\/0885064X89900010"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[1989,6]]},"references-count":18,"journal-issue":{"issue":"2","published-print":{"date-parts":[[1989,6]]}},"alternative-id":["0885064X89900010"],"URL":"https:\/\/doi.org\/10.1016\/0885-064x(89)90001-0","relation":{},"ISSN":["0885-064X"],"issn-type":[{"value":"0885-064X","type":"print"}],"subject":[],"published":{"date-parts":[[1989,6]]}}}