Height as a coefficient bound for univariate polynomial factors, part II

Authors:
Zhuojun Liu;Paul S. Wang
Affiliations:
-;-
Venue:
ACM SIGSAM Bulletin
Year:
1994

Citing 6
Cited 0

On the product of the largest roots of a polynomial

Journal of Symbolic Computation
Products of polynomials and a priori estimates for coefficients in polynomial decompositions: a sharp result

Journal of Symbolic Computation
Polynomial factorization: sharp bounds, efficient algorithms

Journal of Symbolic Computation
Schur-Cohn sub-transforms of a polynomial

Journal of Symbolic Computation
The art of computer programming, volume 2 (3rd ed.): seminumerical algorithms

The art of computer programming, volume 2 (3rd ed.): seminumerical algorithms
Early detection of true factors in univariate polynominal factorization

EUROCAL '83 Proceedings of the European Computer Algebra Conference on Computer Algebra

Quantified Score

Hi-index	0.00

Visualization

Abstract

Consider any degree-n polynomial u(x) ∈ Z[x] that is square-free and an * an a0 ≠ 0. An efficient algorithm is given to test if u(x) is ring-ordinary. Let[EQUATION]