Fast integral bases computation
From MaRDI portal
Publication:6660337
DOI10.1007/978-3-031-69070-9_17MaRDI QIDQ6660337
Martin Weimann, Adrien Poteaux
Publication date: 10 January 2025
Cites Work
- Title not available (Why is that?)
- Title not available (Why is that?)
- Computation of integral bases
- A new computational approach to ideal theory in number fields
- Higher Newton polygons and integral bases
- Computing integral bases via localization and Hensel lifting
- Construction of integral basis. I
- Construction of integral basis. IV
- A fast algorithm for polynomial factorization over \(\mathbb Q_p\)
- Computing Riemann-Roch spaces in algebraic function fields and related topics.
- Triangular bases of integral closures
- An algorithm for computing an integral basis in an algebraic function field
- On the complexity of computing integral bases of function fields
- Directed evaluation
- A construction for prime ideals as absolute values of an algebraic field.
- Modern computer algebra
- Complexity of OM factorizations of polynomials over local fields
- Newton polygons of higher order in algebraic number theory
- Local computation of differents and discriminants
- A Construction for Absolute Values in Polynomial Rings
- Computing local integral closures
- Elimination ideal and bivariate resultant over finite fields
This page was built for publication: Fast integral bases computation
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q6660337)
