发现好书期刊,享受阅读乐趣

海量图书期刊资源,随时随地畅享阅读乐趣

A Birthday Paradox for Markov chains with an optimal bound for collision in the Pollard Rho algorithm for discrete logarithm

A Birthday Paradox for Markov chains with an optimal bound for collision in the Pollard Rho algorithm for discrete logarithm

Kim, Jeong Han; Montenegro, Ravi; Peres, Yuval; Tetali, Prasad
  • 期刊名称The Annals of Applied Probability
  • 作者Kim, Jeong Han; Montenegro, Ravi; Peres, Yuval; Tetali, Prasad
  • 卷第20卷
  • 期第2期
  • 印刷ISSN1050-5164
  • 文件大小236.67KB
  • 发表时间2010-04
  • DOI10.1214/09-AAP625
  • 页码495-521
← 返回【学霸图书馆】主页