稀疏多项式的快速并行多点求值

ACM Commun. Comput. Algebra Pub Date : 2017-05-18 DOI:10.1145/3096730.3096732

M. Monagan, Alan Wong

{"title":"稀疏多项式的快速并行多点求值","authors":"M. Monagan, Alan Wong","doi":"10.1145/3096730.3096732","DOIUrl":null,"url":null,"abstract":"In [3] the following polynomial evaluation problem arises. Let A be a sparse polynomial with s terms in Zp[x0,x1,...,xn]. Suppose we seek evaluations of A into t bivariate images in Zp[x0,x1], for some t ≪ s. We do not know a priori the exact number of images t needed. This will be determined by using a trial value T for t, and increasing T as required.","PeriodicalId":7093,"journal":{"name":"ACM Commun. Comput. Algebra","volume":"16 1","pages":"12-14"},"PeriodicalIF":0.0000,"publicationDate":"2017-05-18","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":"2","resultStr":"{\"title\":\"Fast parallel multi-point evaluation of sparse polynomials\",\"authors\":\"M. Monagan, Alan Wong\",\"doi\":\"10.1145/3096730.3096732\",\"DOIUrl\":null,\"url\":null,\"abstract\":\"In [3] the following polynomial evaluation problem arises. Let A be a sparse polynomial with s terms in Zp[x0,x1,...,xn]. Suppose we seek evaluations of A into t bivariate images in Zp[x0,x1], for some t ≪ s. We do not know a priori the exact number of images t needed. This will be determined by using a trial value T for t, and increasing T as required.\",\"PeriodicalId\":7093,\"journal\":{\"name\":\"ACM Commun. Comput. Algebra\",\"volume\":\"16 1\",\"pages\":\"12-14\"},\"PeriodicalIF\":0.0000,\"publicationDate\":\"2017-05-18\",\"publicationTypes\":\"Journal Article\",\"fieldsOfStudy\":null,\"isOpenAccess\":false,\"openAccessPdf\":\"\",\"citationCount\":\"2\",\"resultStr\":null,\"platform\":\"Semanticscholar\",\"paperid\":null,\"PeriodicalName\":\"ACM Commun. Comput. Algebra\",\"FirstCategoryId\":\"1085\",\"ListUrlMain\":\"https://doi.org/10.1145/3096730.3096732\",\"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/3096730.3096732","RegionNum":0,"RegionCategory":null,"ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":null,"EPubDate":"","PubModel":"","JCR":"","JCRName":"","Score":null,"Total":0}

引用次数: 2

摘要

在[3]中出现了以下多项式求值问题。设A是在Zp[x0,x1，…，xn]中有s项的稀疏多项式。假设我们在Zp[x0,x1]中对一些t≪s求A到t个二元图像的求值。我们先验地不知道我们需要多少图像。这将通过对T使用试验值T来确定，并根据需要增加T。

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

查看原文本刊更多论文

Fast parallel multi-point evaluation of sparse polynomials

In [3] the following polynomial evaluation problem arises. Let A be a sparse polynomial with s terms in Z^p[x⁰,x¹,...,xⁿ]. Suppose we seek evaluations of A into t bivariate images in Z^p[x⁰,x¹], for some t ≪ s. We do not know a priori the exact number of images t needed. This will be determined by using a trial value T for t, and increasing T as required.

求助全文

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

来源期刊

ACM Commun. Comput. Algebra

自引率

0.00%

发文量