Bounds on factors in \(\mathbb Z[x]\)
From MaRDI portal
Publication:1930188
DOI10.1016/j.jsc.2012.09.004zbMath1295.12010arXiv0904.3057OpenAlexW1619519317MaRDI QIDQ1930188
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
high-ratio factorizationlarge height polynomial factorspolynomial factor boundspolynomial root bounds
Lua error in Module:PublicationMSCList at line 37: attempt to index local 'msc_result' (a nil value).
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]\)
