We present polynomial-time algorithms for computations involving pronormal subgroups of solvable quotient groups G= G/K, where G is a permutation group. In particular, we show that it is possible to determine in polynomial time whether or not all subgroups of G are pronormal, i.e, whether G is a t-group.

We also present polynomial-time algorithms for determining whether a subgroup U of G is pronormal in G, and to compute the normalizer Nc(U) if U is pronormal in G.