Bounding the coefficients of a divisor of a given polynomial

DOI10.1007/BF01320692zbMath0713.12001OpenAlexW2049578302MaRDI QIDQ749612

Andrew Granville

Publication date: 1990

Published in: Monatshefte für Mathematik (Search for Journal in Brave)

Full work available at URL: https://eudml.org/doc/178475

zbMATH Keywords

algorithms for factoring polynomialscoefficients of a divisor of a polynomial

Mathematics Subject Classification ID

Number-theoretic algorithms; complexity (11Y16) Polynomials in number theory (11C08) Polynomials in real and complex fields: factorization (12D05)

Related Items (4)

Two sharp inequalities for the norm of a factor of a polynomial ⋮ Irreducibility of random polynomials: general measures ⋮ An inequality for the norm of a polynomial factor ⋮ Isomorphisms of algebraic number fields

Cites Work

• An inequality about irreducible factors of integer polynomials
• Unnamed Item

This page was built for publication: Bounding the coefficients of a divisor of a given polynomial