The Computational Complexity of Estimating Convergence Time

Published on ● Video Link: https://www.youtube.com/watch?v=jU4E7MG4UNk



Duration: 43:09
258 views
6


Nayantara Bhatnagar, University of Delaware
Approximate Counting, Markov Chains and Phase Transitions
https://simons.berkeley.edu/talks/nayantara-bhatnagar-02-25-2016







Tags:
Simons Institute
UC Berkeley
computer science
theory of computing
Counting Complexity and Phase Transitions
Nayantara Bhatnagar