RANDOMIZED INTERPOLATION AND APPROXIMATION OF SPARSE POLYNOMIALS

被引：44
|
作者：
MANSOUR, Y
机构：
[1] IBM CORP,THOMAS J WATSON RES CTR,YORKTOWN HTS,NY 10598
[2] HARVARD UNIV,AIKEN COMPUTAT LAB,CAMBRIDGE,MA 02138
来源：
SIAM JOURNAL ON COMPUTING | 1995年 / 24卷 / 02期
关键词：
POLYNOMIAL INTERPOLATION; RANDOMIZED ALGORITHMS; APPROXIMATION; HARMONIC ANALYSIS;
D O I：
10.1137/S0097539792239291
中图分类号：
TP301 [理论、方法];
学科分类号：
081202 ;
摘要：
We present a randomized algorithm that interpolates a sparse polynomial in polynomial time in the bit complexity model. The algorithm can be also applied to approximate polynomials that can be approximated by sparse polynomials (the approximation is in the L(2) norm).
引用
收藏
页码：357 / 368
页数：12
相关论文
共 50 条
12345