arXiv · math/0504570
Counting points on curves over families in polynomial time
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.
Explore related subjects
Keep this discovery
Jonathan Pila. 2005-04-28. Counting points on curves over families in polynomial time. https://arxiv.org/abs/math/0504570
Cite the original work for its findings. Save a collection to share your selection of sources.