Counting points on curves over families in polynomial time

Simple item page
dc.creatorPila, Jonathan
dc.date2005-04-28
dc.date.accessioned2026-07-07T05:19:28Z
dc.date.available2026-07-07T05:19:28Z
dc.descriptionThis 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.
dc.description7 pages
dc.identifierhttps://arxiv.org/abs/math/0504570
dc.identifierhttp://arxiv.org/abs/math/0504570
dc.identifier.urihttp://salesiana.dossiersoluciones.com/handle/123456789/75029
dc.subjectNumber Theory
dc.subjectAlgebraic Geometry
dc.titleCounting points on curves over families in polynomial time
dc.typetext

Files

Collections

arXiv