原书出处
Introduction to Algorithms, Fourth Edition
31 第31章 数论算法
andomization appeared to be necessary to obtain an efficient (polynomial-time) algorithm.
In 2002, however, Agrawal, Kayal, and Saxena [4] surprised everyone with their deterministic polynomial-time primality-testing algorithm. Until then, the fastest deterministic primality testing algorithm known, due to Cohen and Lenstra [97], ran in (1g n)O(1g1g1g n) time on input n, which is just slightly superpolynomial. Nonetheless, for practical purposes, randomized
primality-testing algorithms remain more efficient and are generally preferred. Beauchemi
原书定位详情
来源:a19c7933-4eda-4176-aebd-30fe7e1ad292
正文位置:extracted/Introduction to Algorithms, Fourth Edition/_epub-src/OEBPS/chapter031.xhtml
EPUB SHA-256:ec7ced04bb875b93983816aef7a667855a4b71c5cf53b63406b9439c74e27aea