On the number of divisors of a polynomial over GF(2)
Proceedings of the 2nd international conference, AAECC-2 on Applied algebra, algorithmics and error-correcting codes
Modern Computer Algebra
Classical and quantum function reconstruction via character evaluation
Journal of Complexity - Special issue on coding and cryptography
Quantum Algorithms for Some Hidden Shift Problems
SIAM Journal on Computing
Algebraic independence and blackbox identity testing
Information and Computation
| Hi-index | 0.00 |
Motivated by some algorithmic applications, we obtain upper bounds on the number of solutions of the equation x"1...x"n=@l with variables x"1,...,x"n from a low-dimensional affine space in a high degree extension of a finite field. These are analogues of several recent bounds on the number of solutions of congruences of the similar form with variables in short intervals. We apply this to the recently introduced algorithmic problem of identity testing between shifted power functions in finite fields.