Efficient Algorithms for the Riemann-Roch Problem and for Addition in the Jacobian of a Curve

We study the effective Riemann-Roch problem of computing a basis for the linear space L(D) associated with a divisor D on a plane curve C and its applications. Our presentation begins with an extension of Noether's algorithm for this problem to plane curves with singularities. Like the original, this algorithm has a worst-case complexity of ?(n!|D|), where n is the degree of the curve C.We next consider representations of divisors based on Chow forms. Using these, we produce a factorization-free polynomial-time algorithm for the effective Riemann-Roch problem, which improves the complexity of Noether's algorithm by an order of magnitude. We also present further improvements which, for curves of bounded degree, yield an algorithm with complexity which is linear in the size of the given divisor. Finally, we consider applications of this problem: to the arithmetic of the Jacobian of a plane curve, to the construction of rational functions on a curve with prescribed zeroes and poles, and to the construction of curves with prescribed intersections.

[1]  Alkiviadis G. Akritas,et al.  Elements of Computer Algebra with Applications , 1989 .

[2]  V. D. Goppa.  Geometry and Codes , 1988 .

[3]  B. L. Waerden,et al.  Zur algebraischen Geometrie. IX , 1937 .

[4]  F. Torres,et al.  Algebraic Curves over Finite Fields , 1991 .

[5]  A. Weil.  Sur les courbes algébriques et les variétés qui s'en déduisent , 1948 .

[6]  David Mumford,et al.  Curves and their Jacobians , 1975 .

[7]  Marek Karpinski,et al.  Interpolation of sparse rational functions without knowing bounds on exponents , 1990, Proceedings [1990] 31st Annual Symposium on Foundations of Computer Science.

[8]  Dexter Kozen,et al.  The Design and Analysis of Algorithms , 1991, Texts and Monographs in Computer Science.

[9]  Wei-Liang Chow.  On the defining field of a divisor in an algebraic variety , 1950 .

[10]  Ming-Deh A. Huang,et al.  Primality Testing and Abelian Varieties over Finite Fields , 1992 .

[11]  Ming-Deh A. Huang,et al.  Counting rational points on curves over finite fields , 1993, Proceedings of 1993 IEEE 34th Annual Foundations of Computer Science.

[12]  M. Tsfasman,et al.  Modular curves, Shimura curves, and Goppa codes, better than Varshamov‐Gilbert bound , 1982 .

[13]  W. Fulton.  Algebraic curves , 1969 .

[14]  Doug Ierardi,et al.  Quantifier elimination in the theory of an algebraically-closed field , 1989, STOC '89.

[15]  V. Shoup.  New algorithms for finding irreducible polynomials over finite fields , 1990 .

[16]  Jacob T. Schwartz,et al.  Fast Probabilistic Algorithms for Verification of Polynomial Identities , 1980, J. ACM.

[17]  D. Cantor.  Computing in the Jacobian of a hyperelliptic curve , 1987 .

[18]  John F. Canny,et al.  Some algebraic and geometric computations in PSPACE , 1988, STOC '88.

[19]  Dexter Kozen,et al.  Parallel Resultant Computation , 1990 .