论文部分内容阅读
We examine the problem of discovering a sparse polynomial from noisy samples at chosen points.Recent progress in efficient sparse interpolation algorithms over exact domains such as integers and finite fields is based on reducing the problem with potentially large degree to a related one with much lower degree.We will discuss the challenges and successes in adapting these techniques to the numeric setting.