Mark van Hoeij - FSU

An algorithm will be described that computes, in polynomial time, a set S consisting of certain subfields of an algebraic number field, such that any subfield can be obtained as an intersection of elements of S.