## Markov Chains and Polynomial time Algorithms (1994)

by
Ravi Kannan

Citations: | 47 - 0 self |

### BibTeX

@MISC{Kannan94markovchains,

author = {Ravi Kannan},

title = {Markov Chains and Polynomial time Algorithms},

year = {1994}

}

### Years of Citing Articles

### OpenURL

### Abstract

This paper outlines the use of rapidly mixing Markov Chains in randomized polynomial time algorithms to solve approximately certain counting prob-lems. They fall into two classes: combinatorial problems like counting the number of perfect matchings in certain graphs and geometric ones like computing the volumes of convex sets.