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

Mostrar todas las versiones(3)

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...

Descripción completa

Guardado en:
Detalles Bibliográficos
Autores principales: Cafure, A., Matera, G.
Formato: JOUR
Materias:
First Bertini theorem
Geometric solutions
Probabilistic algorithms
Rational points
Straight-line programs
Varieties over finite fields
Acceso en línea:http://hdl.handle.net/20.500.12110/paper_00255718_v75_n256_p2049_Cafure
Aporte de:
Biblioteca Digital - Facultad de Ciencias Exactas y Naturales (UBA) de Universidad de Buenos Aires

Ejemplares similares

Ejemplares similares