Approximate Counting, Uniform Generation and Rapidly Mixing Markov Chains Project Seminar Speaker: Girish Varma School of Technology and Computer Science Tata Institute of Fundamental Research Homi Bhabha Road <brTime: Monday, 6 September 2010 (All day) Venue: AG-69 Most algorithmic problems could be viewed as questions being asked about a natural binary relation and we can classify them into decision, search, uniform generation and counting. Read more about Approximate Counting, Uniform Generation and Rapidly Mixing Markov Chains