New recombination algorithms for bivariate polynomial factorization based on Hensel lifting

Grégoire Lecerf

doi:10.1007/s00200-010-0121-5

New recombination algorithms for bivariate polynomial factorization based on Hensel lifting

Grégoire Lecerf

Laboratoire de Mathématiques de Versailles

Résultats de recherche: Contribution à un journal › Article › Revue par des pairs

Résumé

We present new faster deterministic and probabilistic recombination algorithms to compute the irreducible decomposition of a bivariate polynomial via the classical Hensel lifting technique. For the dense bi-degree polynomial representation, the costs of our recombination algorithms are essentially sub-quadratic.

langue originale	Anglais
Pages (de - à)	151-176
Nombre de pages	26
journal	Applicable Algebra in Engineering, Communication and Computing
Volume	21
Numéro de publication	2
Les DOIs	https://doi.org/10.1007/s00200-010-0121-5
état	Publié - 1 janv. 2010
Modification externe	Oui

Accès au document

10.1007/s00200-010-0121-5

Autres fichiers et liens

Lien vers la publication dans Scopus

Contient cette citation

@article{3c6dfd0209314f2e918fa86310e23b92,

title = "New recombination algorithms for bivariate polynomial factorization based on Hensel lifting",

abstract = "We present new faster deterministic and probabilistic recombination algorithms to compute the irreducible decomposition of a bivariate polynomial via the classical Hensel lifting technique. For the dense bi-degree polynomial representation, the costs of our recombination algorithms are essentially sub-quadratic.",

keywords = "Hensel lifting, Polynomial factorization",

author = "Gr{\'e}goire Lecerf",

year = "2010",

month = jan,

day = "1",

doi = "10.1007/s00200-010-0121-5",

language = "English",

volume = "21",

pages = "151--176",

journal = "Applicable Algebra in Engineering, Communication and Computing",

issn = "0938-1279",

number = "2",

}

TY - JOUR

T1 - New recombination algorithms for bivariate polynomial factorization based on Hensel lifting

AU - Lecerf, Grégoire

PY - 2010/1/1

Y1 - 2010/1/1

N2 - We present new faster deterministic and probabilistic recombination algorithms to compute the irreducible decomposition of a bivariate polynomial via the classical Hensel lifting technique. For the dense bi-degree polynomial representation, the costs of our recombination algorithms are essentially sub-quadratic.

AB - We present new faster deterministic and probabilistic recombination algorithms to compute the irreducible decomposition of a bivariate polynomial via the classical Hensel lifting technique. For the dense bi-degree polynomial representation, the costs of our recombination algorithms are essentially sub-quadratic.

KW - Hensel lifting

KW - Polynomial factorization

UR - https://www.scopus.com/pages/publications/77952012310

U2 - 10.1007/s00200-010-0121-5

DO - 10.1007/s00200-010-0121-5

M3 - Article

AN - SCOPUS:77952012310

SN - 0938-1279

VL - 21

SP - 151

EP - 176

JO - Applicable Algebra in Engineering, Communication and Computing

JF - Applicable Algebra in Engineering, Communication and Computing

IS - 2

ER -

New recombination algorithms for bivariate polynomial factorization based on Hensel lifting

Résumé

Accès au document

Autres fichiers et liens

Empreinte digitale

Contient cette citation