{"title":"Seeking better algorithms for approximate GCD","authors":"Kosaku Nagasaka","doi":"10.1145/3096730.3096733","DOIUrl":null,"url":null,"abstract":"We are interested in seeking better algorithms by just slightly updating and combining the well-known algorithms for the following well-known problem in Symbolic-Numeric Computations.","PeriodicalId":7093,"journal":{"name":"ACM Commun. Comput. Algebra","volume":"272 1","pages":"15-17"},"PeriodicalIF":0.0000,"publicationDate":"2017-05-18","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":"1","resultStr":null,"platform":"Semanticscholar","paperid":null,"PeriodicalName":"ACM Commun. Comput. Algebra","FirstCategoryId":"1085","ListUrlMain":"https://doi.org/10.1145/3096730.3096733","RegionNum":0,"RegionCategory":null,"ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":null,"EPubDate":"","PubModel":"","JCR":"","JCRName":"","Score":null,"Total":0}
引用次数: 1
Abstract
We are interested in seeking better algorithms by just slightly updating and combining the well-known algorithms for the following well-known problem in Symbolic-Numeric Computations.
京公网安备 11010802042870号
京ICP备2023020795号-1
分享
求助内容：
应助结果提醒方式：
扫码关注我们
