A polynomial reduction algorithm
From MaRDI portal
Recommendations
Cites work
Cited in
(17)- On computing subfields. A detailed description of the algorithm
- A note on polynomial reduction
- The complexity of computing all subfields of an algebraic number field
- A survey of computational class field theory
- A reduction algorithm meeting users' requirements.
- Computing hypergeometric solutions of second order linear differential equations using quotients of formal solutions and integral bases
- Reducing number field defining polynomials: an application to class group computations
- Non-primitive number fields of degree eight and of signature (2,3), (4,2), and (6,1) with small discriminant
- Tables of octic fields with a quartic subfield
- Computing ray class groups, conductors and discriminants
- A poly-algorithmic approach to simplifying elementary functions
- scientific article; zbMATH DE number 1929311 (Why is no real title available?)
- Block Systems of a Galois Group
- Computing the Hilbert class field of real quadratic fields
- Selected applications of LLL in number theory
- Topics in computational algebraic number theory
- Modular Las Vegas algorithms for polynomial absolute factorization
This page was built for publication: A polynomial reduction algorithm
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q4017063)