Combinatorics and Statistical Mechanics
Cambridge University
Add to My Podcasts
Episodes
About
Reviews
Promote
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
Add to My Queue
Download
MP3
Share
episode
Share at current time
Show notes
Montenegro, R (Massachusetts Lowell)
Wednesday 26 March 2008,
Markov-chain Monte Carlo Methods
Watch Video
Previous
Proving slow mixing with fault lines and fat contours
Next
Properties of the interfaces in the multyphase regimes
← See all 143 episodes of Combinatorics and Statistical Mechanics