Computing components and projections of curves over finite fields

Joachim Von Zur Gathen; Igor Shparlinski

Computing components and projections of curves over finite fields

Joachim Von Zur Gathen^*, Igor Shparlinski

^*Corresponding author for this work

School of Computing

Research output: Contribution to journal › Article › peer-review

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 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

Cite this

@article{00f87ee08411447eaa82d87b25b75a5f,

title = "Computing components and projections of curves over finite fields",

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.{"}.",

keywords = "Approximation algorithms, Computational algebraic geometry, Curves over finite fields",

author = "\{Von Zur Gathen\}, Joachim and Igor Shparlinski",

year = "1999",

language = "English",

volume = "28",

pages = "822--840",

journal = "SIAM Journal on Computing",

issn = "0097-5397",

publisher = "Society for Industrial and Applied Mathematics Publications",

number = "3",

}

TY - JOUR

T1 - Computing components and projections of curves over finite fields

AU - Von Zur Gathen, Joachim

AU - Shparlinski, Igor

PY - 1999

Y1 - 1999

N2 - 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.".

AB - 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.".

KW - Approximation algorithms

KW - Computational algebraic geometry

KW - Curves over finite fields

UR - https://www.scopus.com/pages/publications/0032256263

M3 - Article

AN - SCOPUS:0032256263

SN - 0097-5397

VL - 28

SP - 822

EP - 840

JO - SIAM Journal on Computing

JF - SIAM Journal on Computing

IS - 3

ER -

Computing components and projections of curves over finite fields

Abstract

Keywords

Other files and links

Fingerprint

Cite this