Computing subfields: Reverse of the primitive element problem
Daniel Lazard, Annick Valibouze · Birkhäuser Boston eBooks · 1993
We describe an algorithm which computes all subfields of an effectively given finite algebraic extension. Although the base field can be arbitrary, we focus our attention on the rationals. This appears to be a fundamental tool for the simplification of algebraic numbers. These keywords were added by machine and not by the authors. This process is experimental and the keywords may be updated as the learning algorithm improves.