Height as a coefficient bound for univariate polynomial factors
Zhuojun Liu, Paul S. Wang · ACM SIGSAM Bulletin · 1994
A priori bound for the size of coefficients of the desired factors is important for modern polynomial factoring algorithms. Experts have long suspected that the maximum coefficient size in a given polynomial, called the height , is a good heuristic bound. Developed are sufficient conditions under which the simple height bound is actually valid. Efficient ways to check these conditions are investigated and implemented.