Single-factor coefficient bounds

DOI10.1016/J.JSC.2004.05.006MaRDI QIDQ2643575zbMATH OpenOpenAlexFDO

Authors George E. Collins

Publication date 24 August 2007

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

Full work available at URL https://doi.org/10.1016/j.jsc.2004.05.006

zbMATH Keywords

coefficient boundsfactorizationpolynomials

Mathematics Subject Classification ID

Polynomials in number theory (11C08) Polynomials in general fields (irreducibility, etc.) (12E05)

Recommendations

• Bounds on factors in \(\mathbb Z[x]\)
• Bounds for the height of a factor of a polynomial in terms of Bombieri's norms. I: The largest factor
• scientific article; zbMATH DE number 681099
• Bounds for heights of integer polynomial factors
• Bounding the coefficients of a divisor of a given polynomial

Cites work

• scientific article; zbMATH DE number 1052006 (Why is no real title available?)
• Polynomial factorization: Sharp bounds, efficient algorithms
• Quantifier elimination by cylindrical algebraic decomposition -- twenty years of progress
• The complexity of quantifier elimination and cylindrical algebraic decomposition

Cited in

(1)

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

This page was built for publication: Single-factor coefficient bounds

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q2643575)