INI : Montenegro, 2008-03-26 : A birthday paradox for Markov chains, with an optimal bound for collision in the Pollard Rho algorithm for discrete logarithm : page 7

go to: [previous section] [thumbnails] [next section]

1 2 3 4 5 6 7 [8] 9 10 11 12 13 14 15 16 17 18 19 20 21 22 23 24 25 26 27 28 29 30 31

section 008

go to: [previous section] [thumbnails] [next section]

1 2 3 4 5 6 7 [8] 9 10 11 12 13 14 15 16 17 18 19 20 21 22 23 24 25 26 27 28 29 30 31

Newton Institute > Web Seminars > Programmes & Workshops > 2008 > CSM > CSMW02 > Montenegro, 2008-03-26 > page 8

Comments or suggestions? Send feedback!