知识卡片
AKS实现确定性多项式素性判定
2002年的AKS算法表明素性判定存在确定性多项式时间方法,因此随机化并非取得多项式时间的必要条件。
是否适合实际应用还要比较常数与实现成本,不能把复杂度类别直接等同于更快。
这张卡片看不懂?
这张卡片的反馈已满 10 条,暂时无法继续提交。
已有反馈 · 0 / 10 条
还没有人提交反馈。
在整书笔记中的位置
原书出处 · 1 处
- 第31章 数论算法 · 查看原书依据
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
参考来源
- 位置:《算法导论(第4版)》第31章《数论算法》(OEBPS/chapter031.xhtml,文本字符[100000,104497))。
- 结论依据:第31章相应定理、习题定义或章末注释;相关图式与来源段落已核对。
- 原始内容: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