{"title":"基于扩展自身构造的EZ-GCD算法改进","authors":"Masaru Sanuki","doi":"10.1145/3338637.3338649","DOIUrl":null,"url":null,"abstract":"In [2], we proposed the EZ-GCD algorithm based on extended Hensel construction, in order to compute the GCD of multivariate polynomials. The extended Hensel construction is a specify factorization into algebraic function, and it is efficient for sparse multivariate polynomials. However, it is slower than Maple's GCD routine. In this paper, we improve our EZ-GCD algorithm efficiency.","PeriodicalId":7093,"journal":{"name":"ACM Commun. Comput. Algebra","volume":"35 1","pages":"148-150"},"PeriodicalIF":0.0000,"publicationDate":"2019-05-30","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":"0","resultStr":"{\"title\":\"Improvement of EZ-GCD algorithm based on extended hensel construction\",\"authors\":\"Masaru Sanuki\",\"doi\":\"10.1145/3338637.3338649\",\"DOIUrl\":null,\"url\":null,\"abstract\":\"In [2], we proposed the EZ-GCD algorithm based on extended Hensel construction, in order to compute the GCD of multivariate polynomials. The extended Hensel construction is a specify factorization into algebraic function, and it is efficient for sparse multivariate polynomials. However, it is slower than Maple's GCD routine. In this paper, we improve our EZ-GCD algorithm efficiency.\",\"PeriodicalId\":7093,\"journal\":{\"name\":\"ACM Commun. Comput. Algebra\",\"volume\":\"35 1\",\"pages\":\"148-150\"},\"PeriodicalIF\":0.0000,\"publicationDate\":\"2019-05-30\",\"publicationTypes\":\"Journal Article\",\"fieldsOfStudy\":null,\"isOpenAccess\":false,\"openAccessPdf\":\"\",\"citationCount\":\"0\",\"resultStr\":null,\"platform\":\"Semanticscholar\",\"paperid\":null,\"PeriodicalName\":\"ACM Commun. Comput. Algebra\",\"FirstCategoryId\":\"1085\",\"ListUrlMain\":\"https://doi.org/10.1145/3338637.3338649\",\"RegionNum\":0,\"RegionCategory\":null,\"ArticlePicture\":[],\"TitleCN\":null,\"AbstractTextCN\":null,\"PMCID\":null,\"EPubDate\":\"\",\"PubModel\":\"\",\"JCR\":\"\",\"JCRName\":\"\",\"Score\":null,\"Total\":0}","platform":"Semanticscholar","paperid":null,"PeriodicalName":"ACM Commun. Comput. Algebra","FirstCategoryId":"1085","ListUrlMain":"https://doi.org/10.1145/3338637.3338649","RegionNum":0,"RegionCategory":null,"ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":null,"EPubDate":"","PubModel":"","JCR":"","JCRName":"","Score":null,"Total":0}
Improvement of EZ-GCD algorithm based on extended hensel construction
In [2], we proposed the EZ-GCD algorithm based on extended Hensel construction, in order to compute the GCD of multivariate polynomials. The extended Hensel construction is a specify factorization into algebraic function, and it is efficient for sparse multivariate polynomials. However, it is slower than Maple's GCD routine. In this paper, we improve our EZ-GCD algorithm efficiency.
京公网安备 11010802042870号
京ICP备2023020795号-1
分享
求助内容：
应助结果提醒方式：
扫码关注我们
