The following pages link to Generating subfields (Q1940927):
Displaying 14 items.
- On computing subfields. A detailed description of the algorithm (Q1292617) (← links)
- On computing subfields (Q1369798) (← links)
- Computing subfields of number fields and applications to Galois group computations (Q1733297) (← links)
- The complexity of computing all subfields of an algebraic number field (Q1733310) (← links)
- Identifying central endomorphisms of an abelian variety via Frobenius endomorphisms (Q2038099) (← links)
- Computing groups of Hecke characters (Q2093681) (← links)
- Field extensions defined by power compositional polynomials (Q2116688) (← links)
- (Q4359499) (← links)
- A classification of ECM-friendly families of elliptic curves using modular curves (Q5070546) (← links)
- DETERMINING GALOIS GROUPS OF REDUCIBLE POLYNOMIALS VIA DISCRIMINANTS AND LINEAR RESOLVENTS (Q5075057) (← links)
- Boolean FIP ring extensions (Q5107019) (← links)
- Computation of Galois groups of rational polynomials (Q5170255) (← links)
- Ring extensions of length two (Q5231721) (← links)
- (Q6182374) (← links)
