Counting points on curves over families in polynomial time

Thumbnail Image

Date

Authors

Journal Title

Journal ISSN

Volume Title

Publisher

Abstract

Description

This note concerns the theoretical algorithmic problem of counting rational points on curves over finite fields. It explicates how the algorithmic scheme introduced by Schoof and generalized by the author yields an algorithm whose running time is uniformly polynomial time for curves in families.
7 pages

Keywords

Number Theory, Algebraic Geometry

Citation

URI

http://salesiana.dossiersoluciones.com/handle/123456789/75029

Consulte el texto completo en el siguiente enlace:

https://arxiv.org/abs/math/0504570
 http://arxiv.org/abs/math/0504570

Collections

arXiv