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 条

[1] Sharp precision in Hensel lifting for bivariate polynomial factorization
Lecerf, G
MATHEMATICS OF COMPUTATION, 2006, 75 (254) : 921 - 933
[2] New recombination algorithms for bivariate polynomial factorization based on Hensel lifting
Lecerf, Gregoire
APPLICABLE ALGEBRA IN ENGINEERING COMMUNICATION AND COMPUTING, 2010, 21 (02) : 151 - 176
[3] ON BIVARIATE POLYNOMIAL FACTORIZATION OVER FINITE-FIELDS
SHPARLINSKI, IE
MATHEMATICS OF COMPUTATION, 1993, 60 (202) : 787 - 791
[4] New recombination algorithms for bivariate polynomial factorization based on Hensel lifting
Grégoire Lecerf
Applicable Algebra in Engineering, Communication and Computing, 2010, 21 : 151 - 176
[5] Bivariate polynomial reduction and elimination ideal over finite fields
Villard, Gilles
JOURNAL OF SYMBOLIC COMPUTATION, 2025, 127
[6] On bivariate Hensel lifting and its parallelization
Bernardin, Laurent
Proceedings of the International Symposium on Symbolic and Algebraic Computation, ISSAC, : 96 - 100
[7] New Bivariate Hensel lifting algorithm for n factors
Paluck, Garrett
Monagan, Michael
ACM COMMUNICATIONS IN COMPUTER ALGEBRA, 2019, 53 (03): : 142 - 145
[8] BIVARIATE TRINOMIALS OVER FINITE FIELDS
Avendano, Martin
Martin-Morales, Jorge
HOUSTON JOURNAL OF MATHEMATICS, 2021, 47 (03): : 535 - 552
[9] The complexity of sparse Hensel lifting and sparse polynomial factorization
Monagan, Michael
Tuncer, Baris
JOURNAL OF SYMBOLIC COMPUTATION, 2020, 99 : 189 - 230
[10] Polynomial spaces over finite fields
Winterhof, A
LINEAR ALGEBRA AND ITS APPLICATIONS, 1999, 295 (1-3) : 223 - 229

← 1 2 3 4 5 →