Efficient computation of Riemann-Roch spaces for plane curves with ordinary singularities
From MaRDI portal
Publication:6631548
DOI10.1007/s00200-022-00588-xMaRDI QIDQ6631548
Grégoire Lecerf, Simon Abelard, Alain Couvreur
Publication date: 1 November 2024
Published in: Applicable Algebra in Engineering, Communication and Computing (Search for Journal in Brave)
Cites Work
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Deterministic root finding over finite fields using Graeffe transforms
- Efficient \(p\)th root computations in finite fields of characteristic \(p\)
- On the integration of algebraic functions
- On lattice reduction for polynomial matrices
- The theory of algebraic functions of one variable and their application to algebraic curves and abelian integrals.
- The theory of algebraic functions of one variable.
- On algebraic functions and the use in geometry.
- Computing Riemann-Roch spaces in algebraic function fields and related topics.
- On the complexity of the Lickteig-Roy subresultant algorithm
- Efficient algorithms for the Riemann-Roch problem and for addition in the Jacobian of a curve
- Computing Riemann-Roch spaces via Puiseux expansions
- Directed evaluation
- Fast multivariate multi-point evaluation revisited
- Algebraic curves, the Brill and Noether way
- Lifting and recombination techniques for absolute factorization
- Fast separable factorization and applications
- A concise proof of the Kronecker polynomial system solver from scratch
- Polynomial root finding over local rings and application to error correcting codes
- On the complexity exponent of polynomial system solving
- Computational Linear and Commutative Algebra
- Modern Computer Algebra
- Fast Computation of Shifted Popov Forms of Polynomial Matrices via Systems of Modular Polynomial Equations
- Symbolic Hamburger-Noether expressions of plane curves and applications to AG codes
- Fast Polynomial Factorization and Modular Composition
- New Algorithms for Finding Irreducible Polynomials Over Finite Fields
- Asymptotically fast group operations on Jacobians of general curves
- The Arithmetic of Elliptic Curves
- ALGEBRAICO-GEOMETRIC CODES
- Modular curves, Shimura curves, and Goppa codes, better than Varshamov-Gilbert bound
- Codes and information
- Duality Applied to the Complexity of Matrix Multiplication and Other Bilinear Forms
- Using Algebraic Geometry
- A fast randomized geometric algorithm for computing Riemann-Roch spaces
- Composition Modulo Powers of Polynomials
- Computing Popov and Hermite Forms of Rectangular Polynomial Matrices
- Sub-quadratic time for riemann-roch spaces
- Isogenies and the Discrete Logarithm Problem in Jacobians of Genus 3 Hyperelliptic Curves
- Algorithms – ESA 2004
- Algorithme de Brill-Noether et codes de Goppa
- Fast construction of irreducible polynomials over finite fields
This page was built for publication: Efficient computation of Riemann-Roch spaces for plane curves with ordinary singularities