Multi-modular approach to polynomial-time factorization of bivariate integral polynomials

DOI10.1006/JSCO.1994.1034zbMath0820.11077OpenAlexW2092798930MaRDI QIDQ1338743

Kazuhiro Yokoyama, Masayuki Noro, Taku Takeshima

Publication date: 14 September 1995

Published in: Journal of Symbolic Computation (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1006/jsco.1994.1034

zbMATH Keywords

algorithmdeterministic algorithmsmultivariate polynomialscomplexity analysiscompatible pairHensel liftingpolynomial-time factoringreconstruction classesreconstruction graphsspecialization to two variables

Mathematics Subject Classification ID

Symbolic computation and algebraic computation (68W30) Number-theoretic algorithms; complexity (11Y16) Polynomials, factorization in commutative rings (13P05) Polynomials (irreducibility, etc.) (11R09)

This page was built for publication: Multi-modular approach to polynomial-time factorization of bivariate integral polynomials