Computation of triangular integral bases
From MaRDI portal
Recommendations
Cites work
- A new computational approach to ideal theory in number fields
- An algorithm for computing an integral basis in an algebraic function field
- Complexity of OM factorizations of polynomials over local fields
- Computation of integral bases
- Construction and estimation of bases in function fields
- Fast multiplication of large numbers
- Higher Newton polygons and integral bases
- scientific article; zbMATH DE number 435565 (Why is no real title available?)
- scientific article; zbMATH DE number 729452 (Why is no real title available?)
- scientific article; zbMATH DE number 5050432 (Why is no real title available?)
- Implementing the Round Four maximal order algorithm
- Single-factor lifting and factorization of polynomials over local fields
- Triangular bases of integral closures
This page was built for publication: Computation of triangular integral bases
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q6165856)