并行多项式求值的最优算法

Journal of computer and system sciences (Print) Pub Date : 1971-10-13 DOI:10.1109/SWAT.1971.23

I. Munro, M. Paterson

{"title":"并行多项式求值的最优算法","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":"{\"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}","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

摘要

给出了在具有k个独立算术处理器的假设计算机上求多项式的算法。结果表明，当待求多项式的阶数超过k[log 2k]时，给出的算法在一个时间单位内达到最优性。

本文章由计算机程序翻译，如有差异，请以英文原文为准。

查看原文

微信好友朋友圈 QQ好友复制链接

本刊更多论文

Optimal Algorithms for Parallel Polynomial Evaluation

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.

求助全文

通过发布文献求助，成功后即可免费获取论文全文。去求助

来源期刊

Journal of computer and system sciences (Print)

自引率

0.00%

发文量

期刊最新文献

Searching for better fill-in Preprocessing subgraph and minor problems: When does a small vertex cover help? Drawing a tree as a minimum spanning tree approximation The parameterized complexity of some minimum label problems A linear vertex kernel for maximum internal spanning tree