animprovedearlyterminationsparseinterpolationalgorithmformultivariatepolynomials
文献类型：期刊论文
| 作者 | Huang Qiaolong |
| 刊名 | journalofsystemsscienceandcomplexity
 |
| 出版日期 | 2018 |
| 卷号 | 031期号:002页码:539 |
| ISSN号 | 1009-6124 |
| 英文摘要 | This paper presents an improved early termination algorithm for sparse black box multivariate polynomials, which reduces the interpolation problem into several sub-interpolation problems with less variables and fewer terms. Actually, all interpolations are eventually reduced to the interpolation of a list of polynomials with less terms than that of the original polynomial. Extensive experiments show that the new algorithm is much faster than the original algorithm. |
| 语种 | 英语 |
| 源URL | [http://ir.amss.ac.cn/handle/2S8OKBNM/40729]  |
| 专题 | 中国科学院数学与系统科学研究院 |
| 作者单位 | 中国科学院数学与系统科学研究院 |
| 推荐引用方式 GB/T 7714 | Huang Qiaolong. animprovedearlyterminationsparseinterpolationalgorithmformultivariatepolynomials[J]. journalofsystemsscienceandcomplexity,2018,031(002):539. |
| APA | Huang Qiaolong.(2018).animprovedearlyterminationsparseinterpolationalgorithmformultivariatepolynomials.journalofsystemsscienceandcomplexity,031(002),539. |
| MLA | Huang Qiaolong."animprovedearlyterminationsparseinterpolationalgorithmformultivariatepolynomials".journalofsystemsscienceandcomplexity 031.002(2018):539. |
入库方式： OAI收割
来源：数学与系统科学研究院
浏览0
下载0
收藏0
其他版本
除非特别说明，本系统中所有内容都受版权保护，并保留所有权利。