Pollard's rho算法1975
Pollard's rho algorithm
algorithm
Pollard's rho algorithm is an algorithm for integer factorization. It was invented by John Pollard in 1975. It uses only a small amount of space, and its expected running time is proportional to the square root of the smallest prime factor of the composite number being factorized.
摘自英文维基百科「Pollard's rho algorithm」(英文维基百科,暂无中文条目),CC BY-SA 4.0
- 类型
- 算法
- 发现 / 发明时间
- 1975 年
- 发现者 / 提出者
- 约翰·波拉德
- 命名来源
- 约翰·波拉德
- 学科
- 数学