Antonio Cafure
Current Organizations / Institutes
The organizations/institutes from the scholar's latest article
Antonio Cafure has a total of 2 co-authors. Here are the top co-authors by number of shared publications:
- Guillermo Matera
National Council of Science and Technology (CONICET), Buenos Aires, Argentina
3 shared publications - Ariel Waissbein
CoreLabs, CORE Security Technologies, Buenos Aires, Argentina
1 shared publication
Latest Publications
- 1 January 2008
- Published by Springer Nature
- p. 55-77
Efficient Inversion of Rational Maps Over Finite Fields
- 1 January 2008
- Published by Springer Nature
- p. 55-77
Efficient Inversion of Rational Maps Over Finite Fields
- Open Access
- 20 July 2006
- Published by American Mathematical Society (AMS) in Mathematics of Computation
- Vol. 75 (256) , 2049-2085
Fast computation of a rational point of a variety over a finite field
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 complexity is roughly quadratic in the logarithm of the cardinality of the field and a geometric invariant of the input system. This invariant, called the degree, is bounded by the Bézout number of the system. Our algorithm works for fields of any characteristic, but requires the cardinality of the field to be greater than a quantity which is roughly the fourth power of the degree of the input variety.
- 20 July 2006
- Published by American Mathematical Society (AMS) in Mathematics of Computation
- Vol. 75 (256) , 2049-2085
Open AccessFast computation of a rational point of a variety over a finite field
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 complexity is roughly quadratic in the logarithm of the cardinality of the field and a geometric invariant of the input system. This invariant, called the degree, is bounded by the Bézout number of the system. Our algorithm works for fields of any characteristic, but requires the cardinality of the field to be greater than a quantity which is roughly the fourth power of the degree of the input variety.
- Open Access
Fast computation of a rational point of a variety over a finite field
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 complexity is roughly quadratic in the logarithm of the cardinality of the field and a geometric invariant of the input system (called its degree), which is always bounded by the Bezout number of the system. Our algorithm works for fields of any characteristic, but requires the cardinality of the field to be greater than a quantity which is roughly the fourth power of the degree of the input variety.
Open AccessFast computation of a rational point of a variety over a finite field
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 complexity is roughly quadratic in the logarithm of the cardinality of the field and a geometric invariant of the input system (called its degree), which is always bounded by the Bezout number of the system. Our algorithm works for fields of any characteristic, but requires the cardinality of the field to be greater than a quantity which is roughly the fourth power of the degree of the input variety.