Add to ORKGAbstract. We explain how to compute the equations of the abelian coverings of any curve defined over a finite field. Then we describe an algorithm which computes curves with many rational points with respect to their genus. The implementation of the algorithm provides 7 new records over F2
AbstractFor an algebraic curve X over the finite field Fq, we denote by N(X) and g(X) the number of ...
We give a deterministic polynomial-time algorithm that computes a nontrivial rational point on an el...
This survey discusses algorithms and explicit calculations for curves of genus at least 2 and their...
International audienceWe explain how to compute the equations of the abelian coverings of any curve ...
This thesis surveys the issue of finding rational points on algebraic curves over finite fields. Sin...
We give a simple and effective method for the construction of algebraic curves over finite fields w...
L'étude du nombre de points rationnels d'une courbe définie sur un corps fini se divise naturellemen...
Abstract. We describe a method that allows, under some hypotheses, to compute all the rational point...
We shall discuss the idea of finding all rational points on a curve C by first finding an associated...
We shall discuss the idea of finding all rational points on a curve C by first finding an associated...
. This paper provides an algorithmic approach to some basic algebraic and combinatorial properties o...
AbstractWe develop efficient methods for deterministic computations with semi-algebraic sets and app...
dx.doi.org/10.2140/obs.2013.1.317 msp Computing equations of curves with many point
We solve two computational problems concerning plane algebraic curves over finite fields: generating...
AbstractWe show that for any finite field Fq, any N⩾0 and all sufficiently large integers g there ex...
AbstractFor an algebraic curve X over the finite field Fq, we denote by N(X) and g(X) the number of ...
We give a deterministic polynomial-time algorithm that computes a nontrivial rational point on an el...
This survey discusses algorithms and explicit calculations for curves of genus at least 2 and their...
International audienceWe explain how to compute the equations of the abelian coverings of any curve ...
This thesis surveys the issue of finding rational points on algebraic curves over finite fields. Sin...
We give a simple and effective method for the construction of algebraic curves over finite fields w...
L'étude du nombre de points rationnels d'une courbe définie sur un corps fini se divise naturellemen...
Abstract. We describe a method that allows, under some hypotheses, to compute all the rational point...
We shall discuss the idea of finding all rational points on a curve C by first finding an associated...
We shall discuss the idea of finding all rational points on a curve C by first finding an associated...
. This paper provides an algorithmic approach to some basic algebraic and combinatorial properties o...
AbstractWe develop efficient methods for deterministic computations with semi-algebraic sets and app...
dx.doi.org/10.2140/obs.2013.1.317 msp Computing equations of curves with many point
We solve two computational problems concerning plane algebraic curves over finite fields: generating...
AbstractWe show that for any finite field Fq, any N⩾0 and all sufficiently large integers g there ex...
AbstractFor an algebraic curve X over the finite field Fq, we denote by N(X) and g(X) the number of ...
We give a deterministic polynomial-time algorithm that computes a nontrivial rational point on an el...
This survey discusses algorithms and explicit calculations for curves of genus at least 2 and their...