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.".
|Number of pages||19|
|Journal||SIAM Journal on Computing|
|Publication status||Published - 1999|
- Approximation algorithms
- Computational algebraic geometry
- Curves over finite fields