On the computation of rational points of a hypersurface over a finite field

DOI10.1016/j.jco.2016.11.003zbMath1371.68334arXiv1504.06512OpenAlexW2963198913MaRDI QIDQ2360665

Mariana Pérez, Melina Privitelli, Guillermo Matera

Publication date: 4 July 2017

Published in: Journal of Complexity (Search for Journal in Brave)

Full work available at URL: https://arxiv.org/abs/1504.06512

zbMATH Keywords

algorithmsrational pointsShannon entropyvalue setsaverage-case complexityhypersurfaces over finite fields

Mathematics Subject Classification ID

Computational aspects of algebraic surfaces (14Q10) Rational points (14G05) Curves over finite and local fields (11G20)

Related Items

On the computation of rational solutions of underdetermined systems over a finite field

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Fast linear homotopy to find approximate zeros of polynomial systems
• Realistic analysis of some randomized algorithms
• On the value set of small families of polynomials over a finite field. I
• Improved explicit estimates on the number of solutions of equations over a finite field
• On the value set of small families of polynomials over a finite field, III
• Handbook of Finite Fields
• Certified Numerical Homotopy Tracking
• On the value set of small families of polynomials over a finite field, II
• Note on a problem of Chowla
• Fast computation of a rational point of a variety over a finite field
• Counting polynomials with a given number of zeros in a finite field
• Tropicalization and irreducibility of generalized Vandermonde determinants
• A New Algorithm for Factoring Polynomials Over Finite Fields
• Finding Points on Curves over Finite Fields
• The values of a polynomial over a finite field
• Counting Reducible, Powerful, and Relatively Irreducible Multivariate Polynomials over Finite Fields