Hensel lifting and bivariate polynomial factorisation over finite fields

被引：0
|
作者：
Gao, SH [1 ]
Lauder, AGB
机构：
[1] Clemson Univ, Dept Math Sci, Clemson, SC 29634 USA
[2] Univ Oxford, Inst Math, Oxford OX1 3LB, England
来源：
MATHEMATICS OF COMPUTATION | 2002年 / 71卷 / 240期
关键词：
bivariate polynomial; finite field; Hensel lifting; factorisation; average-case complexity;
D O I：
暂无
中图分类号：
O29 [应用数学];
学科分类号：
070104 ;
摘要：
This paper presents an average time analysis of a Hensel lifting based factorisation algorithm for bivariate polynomials over finite fields. It is shown that the average running time is almost linear in the input size. This explains why the Hensel lifting technique is fast in practice for most polynomials.
引用
收藏
页码：1663 / 1676
页数：14
相关论文
共 50 条
12345