Identity testing and interpolation from high powers of polynomials of large degree over finite fields.

Journal of Complexity(2018)

引用 1|浏览10
暂无评分
摘要
We consider the problem of identity testing and recovering (that is, interpolating) of a “hidden” monic polynomial f, given an oracle access to f(x)e for x∈Fq, where Fq is the finite field of q elements and queries with x from an extension field are not permitted.
更多
查看译文
关键词
Hidden polynomial,High powers of polynomials,Black-box interpolation,Deterministic algorithm
AI 理解论文
溯源树
样例
生成溯源树,研究论文发展脉络
Chat Paper
正在生成论文摘要