Efficient algorithms for the Riemann-Roch problem and for addition in the Jacobian of a curve

DOI10.1006/jsco.1994.1063zbMath0842.68041OpenAlexW1980117595MaRDI QIDQ1897564

Yanyan Li

Publication date: 4 September 1995

Published in: Journal of Symbolic Computation (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1006/jsco.1994.1063

zbMATH Keywords

Chow formsRiemann-Roch problemfactorization-free polynomial-time algorithm

Mathematics Subject Classification ID

Symbolic computation and algebraic computation (68W30)

Related Items (14)

Group Law Computations on Jacobians of Hyperelliptic Curves ⋮ The arithmetic of Jacobian groups of superelliptic cubics ⋮ Computing Riemann-Roch spaces via Puiseux expansions ⋮ Quasi-equivalence of heights in algebraic function fields of one variable ⋮ A fast randomized geometric algorithm for computing Riemann-Roch spaces ⋮ Computational aspects of retrieving a representation of an algebraic geometry code ⋮ Unnamed Item ⋮ Arithmetic on superelliptic curves ⋮ Algebraic curves and cryptography ⋮ On the computation of coefficients of modular forms: The reduction modulo $p$ approach ⋮ Asymptotically fast group operations on Jacobians of general curves ⋮ Linear algebra algorithms for divisors on an algebraic curve ⋮ Ideal forms of Coppersmith's theorem and Guruswami-Sudan list decoding ⋮ Finding a basis of a linear system with pairwise distinct discrete valuations on an algebraic curve

This page was built for publication: Efficient algorithms for the Riemann-Roch problem and for addition in the Jacobian of a curve