 In permutation groups, it has been proven in (; ) that a Sylow "p"-subgroup and its normalizer can be found in polynomial time of the input (the degree of the group times the number of generators).These algorithms are described in textbook form in , and are now becoming practical as the constructive recognition of finite simple groups becomes a reality.In particular, versions of this algorithm are used in the Magma computer algebra system.