A deterministic algorithm for sparse multivariate polynomial interpolation 论文
1988引用 308
Polynomial and algebraic computationTensor decomposition and applicationsNumerical Methods and Algorithms
摘要
An efficient deterministic polynomial time algorithm is developed for the sparse polynomial interpolation problem. The number of evaluations needed by this algorithm is very small. The algorithm also has a simple NC implementation.