Counting points on curves over families in polynomial time
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.
| Egile nagusia: | |
|---|---|
| Formatua: | Internet publication |
| Hizkuntza: | English |
| Argitaratua: |
2005
|
| Gaia: | 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. |
|---|