ComputingComputer ScienceAlgorithmsComputational GeometryOptimizationFactor AnalysisMatrix FactorizationNumber-theoretic AlgorithmsHensel LiftingMultivariate Polynomial GcdPolynomial CalculusSparse Polynomial Algorithms
An ew a lgorithm is introduced which computes the multivariate leading coefficients of polynomial factors from their univariate images. This algorithm is incorporated into a sparse Hensel lifting scheme and only requires the factorization of a single univariate image. The algorithm also provides the content of the input polynomial in the main variable as a by-product. We sho wh ow w ec an tak ea dvantage of this property when computing the GCD of multivariate polynomials by sparse Hensel lifting.
6
Joel Moses, David Y. Y. Yun · 1973 · 73 citations
Paul S. Wang · ACM SIGSAM Bulletin · 1980 · 38 citations