Bounds on factors in \(\mathbb Z[x]\)

DOI10.1016/J.JSC.2012.09.004zbMath1295.12010arXiv0904.3057OpenAlexW1619519317MaRDI QIDQ1930188

John Abbott

Publication date: 10 January 2013

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

Full work available at URL: https://arxiv.org/abs/0904.3057

zbMATH Keywords

high-ratio factorizationlarge height polynomial factorspolynomial factor boundspolynomial root bounds

Mathematics Subject Classification ID

Symbolic computation and algebraic computation (68W30) Polynomials, factorization in commutative rings (13P05)

Related Items (4)

Certifying Irreducibility in $${\mathbb Z}[x$$] ⋮ Certifying solutions to overdetermined and singular polynomial systems over \(\mathbb{Q}\) ⋮ Methodologies of Symbolic Computation ⋮ A verified implementation of the Berlekamp-Zassenhaus factorization algorithm

This page was built for publication: Bounds on factors in \(\mathbb Z[x]\)