Computing Riemann-Roch spaces via Puiseux expansions
From MaRDI portal
Publication:2171940
DOI10.1016/j.jco.2022.101666zbMath1504.14015OpenAlexW3184168940WikidataQ114163582 ScholiaQ114163582MaRDI QIDQ2171940
Elena Berardini, Alain Couvreur, Simon Abelard, Grégoire Lecerf
Publication date: 12 September 2022
Published in: Journal of Complexity (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1016/j.jco.2022.101666
Related Items
Uses Software
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
- Unnamed Item
- Unnamed Item
- Deterministic root finding over finite fields using Graeffe transforms
- Approximated roots, generating sequences, sufficiency of jets
- Algebroid curves in positive characteristic
- On the theory of adjoints. II
- Geometric theory of algebraic space curves
- The Magma algebra system. I: The user language
- On lattice reduction for polynomial matrices
- Computing Riemann-Roch spaces in algebraic function fields and related topics.
- Lectures on expansion techniques in algebraic geometry. With notes by Balwant Singh
- Efficient algorithms for the Riemann-Roch problem and for addition in the Jacobian of a curve
- Computing Puiseux series: a fast divide and conquer algorithm
- On the complexity of computing integral bases of function fields
- Computing Riemann-Roch spaces via Puiseux expansions
- Directed evaluation
- Algebraic curves, the Brill and Noether way
- Accelerated tower arithmetic
- Fast computation of special resultants
- Computing minimal interpolation bases
- On the complexity exponent of polynomial system solving
- Improving Complexity Bounds for the Computation of Puiseux Series over Finite Fields
- 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
- Algebraic Function Fields and Codes
- 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
- 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
- Algorithms – ESA 2004
- Algorithme de Brill-Noether et codes de Goppa
- An Arithmetic Theory of Adjoint Plane Curves
- Fast construction of irreducible polynomials over finite fields
- Singularities of the modular curve
