{"title":"Optimal Algorithms for Parallel Polynomial Evaluation","authors":"I. Munro, M. Paterson","doi":"10.1109/SWAT.1971.23","DOIUrl":null,"url":null,"abstract":"Algorithms for the evaluation of polynomials on a hypothetical computer with k independent arithmetic processors are presented. It is shown that, provided the degree of the polynomial to be evaluated exceeds k[log\"2k], an algorithm given is within one time unit of optimality.","PeriodicalId":346691,"journal":{"name":"Journal of computer and system sciences (Print)","volume":"1 1","pages":"0"},"PeriodicalIF":0.0000,"publicationDate":"1971-10-13","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":"98","resultStr":null,"platform":"Semanticscholar","paperid":null,"PeriodicalName":"Journal of computer and system sciences (Print)","FirstCategoryId":"1085","ListUrlMain":"https://doi.org/10.1109/SWAT.1971.23","RegionNum":0,"RegionCategory":null,"ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":null,"EPubDate":"","PubModel":"","JCR":"","JCRName":"","Score":null,"Total":0}
引用次数: 98
Abstract
Algorithms for the evaluation of polynomials on a hypothetical computer with k independent arithmetic processors are presented. It is shown that, provided the degree of the polynomial to be evaluated exceeds k[log"2k], an algorithm given is within one time unit of optimality.
京公网安备 11010802042870号
京ICP备2023020795号-1
分享
求助内容：
应助结果提醒方式：
扫码关注我们
