Abstract
This paper provides an algorithmic approach to some basic algebraic and combinatorial properties of algebraic curves over finite fields: the number of points on a curve or a projection, its number of absolutely irreducible components, and the property of being "exceptional.".
| Original language | English |
|---|---|
| Pages (from-to) | 822-840 |
| Number of pages | 19 |
| Journal | SIAM Journal on Computing |
| Volume | 28 |
| Issue number | 3 |
| Publication status | Published - 1999 |
Keywords
- Approximation algorithms
- Computational algebraic geometry
- Curves over finite fields