1 citations · 2 across the 3 of their papers we have counts for
3 papers
math.NT2004
Fast computation of a rational point of a variety over a finite field
Antonio Cafure, Guillermo Matera
We exhibit a probabilistic algorithm which computes a rational point of an absolutely irreducible variety over a finite field defined by a reduced regular sequence. Its time--space…
math.NT2004★ 1 cited
Improved explicit estimates on the number of solutions of equations over a finite field
Antonio Cafure, Guillermo Matera
We show explicit estimates on the number of --rational points of an --definable affine absolutely irreducible variety of the algebraic closure of the finite field of…
math.AC2003★ 1 cited
The hardness of polynomial equation solving
David Castro, Marc Giusti, Joos Heintz +2
In this paper we investigate the intrinsic sequential time complexity of universal elimination procedures for arbitrary continuous data structures encoding input and output objects…