Given a group G of order n and a subset S of G such that |S|=m.
What is the best algorithm for generating all the subgroups of G that contain S? How the complextity of such algorithm depends on n and m? Does it become easyer if G is a symmetric group?