The following pages link to A polynomial reduction algorithm (Q4017063):
Displaying 13 items.
- Topics in computational algebraic number theory (Q558179) (← links)
- Modular Las Vegas algorithms for polynomial absolute factorization (Q607052) (← links)
- On computing subfields. A detailed description of the algorithm (Q1292617) (← links)
- The complexity of computing all subfields of an algebraic number field (Q1733310) (← links)
- A survey of computational class field theory (Q1809036) (← links)
- Computing hypergeometric solutions of second order linear differential equations using quotients of formal solutions and integral bases (Q2628322) (← links)
- Reducing number field defining polynomials: an application to class group computations (Q2971018) (← links)
- Non-primitive number fields of degree eight and of signature (2,3), (4,2), and (6,1) with small discriminant (Q4221982) (← links)
- Tables of octic fields with a quartic subfield (Q4257700) (← links)
- Computing ray class groups, conductors and discriminants (Q4383193) (← links)
- Block Systems of a Galois Group (Q4867488) (← links)
- Computing the Hilbert class field of real quadratic fields (Q4955872) (← links)
- Selected Applications of LLL in Number Theory (Q5188543) (← links)
