We consider the following question. Let F be a reducible univariate polynomial with integer coefficients, find a number b such that F has a factor G with coefficients at most 6 in absolute value. Such a bound is very useful for algorithms of factorization of integer polynomials. For more details see Beauzamy et at (1992).
