Fast computation of a rational point of a variety over a finite field

DOI10.1090/S0025-5718-06-01878-3zbMath1122.11040arXivmath/0406085MaRDI QIDQ3420246

Antonio Cafure, Guillermo Matera

Publication date: 1 February 2007

Published in: Mathematics of Computation (Search for Journal in Brave)

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

zbMATH Keywords

finite fieldrational point of algebraic variety

Mathematics Subject Classification ID

Rational points (14G05) Varieties over finite and local fields (11G25)

Related Items

On the computation of rational points of a hypersurface over a finite field, Improved complexity bounds for counting points on hyperelliptic curves, On the computation of rational solutions of underdetermined systems over a finite field, A concise proof of the Kronecker polynomial system solver from scratch, On the bit complexity of polynomial system solving, Change of order for regular chains in positive dimension, Intrinsic complexity estimates in polynomial optimization, Improved explicit estimates on the number of solutions of equations over a finite field, Counting points on hyperelliptic curves with explicit real multiplication in arbitrary genus, Degeneracy loci and polynomial equation solving

Uses Software

• Kronecker
• ISOLATE

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Computing the equidimensional decomposition of an algebraic closed set by means of lifting fibers
• Counting curves and their projections
• Definability and fast quantifier elimination in algebraically closed fields
• A lower bound for the number of solutions of equations over finite fields
• Equations over finite fields. An elementary approach
• Solving zero-dimensional systems through the rational univariate representation
• Lower bounds for diophantine approximations
• Polar varieties, real equation solving, and data structures: the hypersurface case
• Straight-line programs in geometric elimination theory
• The hardness of polynomial equation solving
• Computing parametric geometric resolutions
• Solvability of systems of polynomial congruences modulo a large prime
• Applied algebra, algebraic algorithms and error-correcting codes. 5th international conference, AAECC-5, Menorca, Spain, June 15-19, 1987. Proceedings
• Quadratic Newton iteration for systems with multiplicity
• Algebraic Geometry. I: Complex projective varieties.
• Effective Noether irreducibility forms and applications
• On the efficiency of effective Nullstellensätze
• Generalized polar varieties: geometry and algorithms
• Hidden conic quadratic representation of some nonconvex quadratic optimization problems
• Improved explicit estimates on the number of solutions of equations over a finite field
• Fast Probabilistic Algorithms for Verification of Polynomial Identities
• The intrinsic complexity of parametric elimination methods
• Le rôle des structures de données dans les problèmes d'élimination
• Finding Points on Curves over Finite Fields
• Extended Hilbert Irreducibility and Its Applications
• On the time-space complexity of geometric elimination procedures
• A Gröbner free alternative for polynomial system solving
• Polar varieties and efficient real elimination