Counting points on curves over families in polynomial time
From MaRDI portal
Publication:6475449
arXivmath/0504570MaRDI QIDQ6475449FDOQ6475449
Authors: Jonathan Pila 
Publication date: 28 April 2005
Abstract: 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.
This page was built for publication: Counting points on curves over families in polynomial time
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q6475449)
