Using zeta functions to factor polynomials over finite fields

被引:2
|
作者
Poonen, Bjorn [1 ]
机构
[1] MIT, Dept Math, Cambridge, MA 02139 USA
基金
美国国家科学基金会;
关键词
Factoring polynomials; zeta function; abelian variety; finite field; ABELIAN-VARIETIES; ROOTS;
D O I
10.1090/conm/722/14528
中图分类号
O1 [数学];
学科分类号
0701 ; 070101 ;
摘要
In 2005, Kayal suggested that Schoof's algorithm for counting points on elliptic curves over finite fields might yield an approach to factor polynomials over finite fields in deterministic polynomial time. We present an exposition of his idea and then explain details of a generalization involving Pila's algorithm for abelian varieties.
引用
收藏
页码:141 / 147
页数:7
相关论文
共 50 条