Motivated by some algorithmic problems, we give lower bounds on the size of the multiplicative groups containing rational function images of low-dimensional affine subspaces of a finite field F-qn considered as a line...
详细信息
Motivated by some algorithmic problems, we give lower bounds on the size of the multiplicative groups containing rational function images of low-dimensional affine subspaces of a finite field F-qn considered as a linear space over a subfield F-q. We apply this to the recently introduced algorithmic problem of identitytesting of "hidden" polynomials f and g over a high degree extension of a finite field, given oracle access to f(x)(e) and g(x)(e).
暂无评论