Computing components and projections of curves over finite fields

Joachim Von Zur Gathen*, Igor Shparlinski

*Corresponding author for this work

Research output: Contribution to journalArticle

4 Citations (Scopus)

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 languageEnglish
Pages (from-to)822-840
Number of pages19
JournalSIAM Journal on Computing
Volume28
Issue number3
Publication statusPublished - 1999

    Fingerprint

Keywords

  • Approximation algorithms
  • Computational algebraic geometry
  • Curves over finite fields

Cite this