Single-factor coefficient bounds

DOI10.1016/J.JSC.2004.05.006zbMATH Open1130.11309OpenAlexW2066995784MaRDI QIDQ2643575FDOQ2643575

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

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
• scientific article; zbMATH DE number 1419238
• Bounding the coefficients of a divisor of a given polynomial

zbMATH Keywords

factorizationpolynomialscoefficient bounds

Mathematics Subject Classification ID

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

Cites Work

• Title not available (Why is that?)
• Title not available (Why is that?)
• The complexity of quantifier elimination and cylindrical algebraic decomposition
• Polynomial factorization: Sharp bounds, efficient algorithms

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)