Roots of sparse polynomials over a finite field
From MaRDI portal
Publication:2971010
DOI10.1112/S1461157016000334zbMath1391.11154arXiv1602.00208MaRDI QIDQ2971010
Publication date: 4 April 2017
Published in: LMS Journal of Computation and Mathematics (Search for Journal in Brave)
Full work available at URL: https://arxiv.org/abs/1602.00208
Related Items (6)
Sparse univariate polynomials with many roots over finite fields ⋮ Estimating the number of roots of trinomials over finite fields ⋮ Root repulsion and faster solving for very sparse polynomials over \(p\)-adic fields ⋮ On the number of distinct roots of a lacunary polynomial over finite fields ⋮ Value Sets of Sparse Polynomials ⋮ Sublinear Root Detection and New Hardness Results for Sparse Polynomials over Finite Fields
Cites Work
- On the correlation of binary \(M\)-sequences
- On the singularity of generalised Vandermonde matrices over finite fields
- Sub-linear root detection, and new hardness results, for sparse polynomials over finite fields
- On the number of solutions of exponential congruences
- On the statistical properties of Diffie-Hellman distributions
This page was built for publication: Roots of sparse polynomials over a finite field
