Counting points on curves over families in polynomial time

Details Counting points on curves over families in polynomial time Counting points on curves over families in polynomial time

2005-04-28

arxiv.org/abs/math/0504570v1

Mathematics

Number Theory

7 pages

Scientific paper

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.

Affiliated with

Also associated with

No associations

Rating

Counting points on curves over families in polynomial time does not yet have a rating. At this time, there are no reviews or comments for this scientific paper.

If you have personal experience with Counting points on curves over families in polynomial time, we encourage you to share that experience with our LandOfFree.com community. Your opinion is very important and Counting points on curves over families in polynomial time will most certainly appreciate the feedback.

Rate now

Comments { 0 }

Profile ID: LFWR-SCP-O-715570