New answers tagged


The answer to the first part of your question is yes. Given a permutation group $G = \langle S \rangle$, there is a polynomial time algorithm (clearly more efficient than the brute force approach which has factorial complexity), the Schreier-Sims algorithm ( which computes a base and strong ...

Top 50 recent answers are included