Statistical complexity of the power method for markov chains
Author:
- Paul E WrightPWPaul E Wright
- 1 June 1989
- journal article
- Published by Elsevier in Journal of Complexity
- Vol. 5 (2) , 119-143
Abstract
No abstract availableKeywords
This publication has 7 references indexed in Scilit:
- Computational Complexity: On the Geometry of Polynomials and a Theory of Cost: IISIAM Journal on Computing, 1986
- On the efficiency of algorithms of analysisBulletin of the American Mathematical Society, 1985
- Computational complexity. On the geometry of polynomials and a theory of cost. IAnnales Scientifiques de lʼÉcole Normale Supérieure, 1985
- On the average number of steps of the simplex method of linear programmingMathematical Programming, 1983
- On the time taken by random walks on finite groups to visit every stateProbability Theory and Related Fields, 1983
- Bounds for eigenvalues of certain stochastic matricesLinear Algebra and its Applications, 1981
- The fundamental theorem of algebra and complexity theoryBulletin of the American Mathematical Society, 1981