Improvement of EZ-GCD algorithm based on extended hensel construction
Abstract
References
- Improvement of EZ-GCD algorithm based on extended hensel construction
Recommendations
The EZ GCD algorithm
ACM '73: Proceedings of the ACM annual conferenceThis paper presents a preliminary report on a new algorithm for computing the Greatest Common Divisor (GCD) of two multivariate polynomials over the integers. The algorithm is strongly influenced by the method used for factoring multivariate polynomials ...
Computation of GCD of Sparse Multivariate Polynomials by Extended Hensel Construction
SYNASC '15: Proceedings of the 2015 17th International Symposium on Symbolic and Numeric Algorithms for Scientific Computing (SYNASC)Let F(x, u1, , ul) be a squarefree multivariate polynomial in main variable x and sub-variables u1, , ul. We say that the leading coefficient (LC) of F is singular if it vanishes at the origin of sub-variables. A representative algorithm for nonsparse ...
An approach to singularity from the extended Hensel construction
Let F(x,u), with (u) = (u1,...,uℓ), be an irreducible multivariate polynomial over C, having singularity at the origin, and let FNew(x,u) be the so-called Newton polynomial for F(x,u). The extended Hensel construction (EHC in short) of F(x,u) allows us ...
Comments
Information & Contributors
Information
Published In
Publisher
Association for Computing Machinery
New York, NY, United States
Publication History
Check for updates
Qualifiers
- Research-article
Contributors
Other Metrics
Bibliometrics & Citations
Bibliometrics
Article Metrics
- 0Total Citations
- 32Total Downloads
- Downloads (Last 12 months)1
- Downloads (Last 6 weeks)0
Other Metrics
Citations
View Options
Login options
Check if you have access through your login credentials or your institution to get full access on this article.
Sign in