Combinatorics and Statistical Mechanics
Combinatorics and Statistical Mechanics
Cambridge University
A birthday paradox for Markov chains, with an optimal bound for collision in the Pollard Rho algorithm for discrete logarithm
24 minutes Posted Apr 1, 2008 at 1:28 pm.
-15:05
0:00
24:33
Download MP3
Show notes
Montenegro, R (Massachusetts Lowell)
Wednesday 26 March 2008,
Markov-chain Monte Carlo Methods