@inproceedings{10.1109/SFCS.1980.34,
    Abstract = {A permutation group on n letters may always be represented by a small set of generators, even though its size may be exponential in n. We show that it is practical to use such a representation since many problems such as membership testing, equality testing, and inclusion testing are decidable in polynomial time. In addition, we demonstrate that the normal closure of a subgroup can be computed in polynomial time, and that this proceaure can be used to test a group for solvability. We also describe an approach to computing the intersection of two groups. The procedures and techniques have wide applicability and have recently been used to improve many graph isomorphism algorithms.},
    Address = {USA},
    Author = {Furst, Merrick and Hopcroft, John and Luks, Eugene},
    BookTitle = {Proceedings of the 21st Annual Symposium on Foundations of Computer Science},
    File = {Polynomial-Time Algorithms for Permutation Groups - furst1980.pdf},
    Pages = {36--41},
    Publisher = {IEEE Computer Society},
    Series = {SFCS '80},
    Title = {Polynomial-Time Algorithms for Permutation Groups},
    URL = {https://doi.org/10.1109/SFCS.1980.34},
    Year = {1980},
    bdsk-url-1 = {https://doi.org/10.1109/SFCS.1980.34},
    date-added = {2021-04-06 15:02:53 +0200},
    date-modified = {2021-04-06 15:02:53 +0200},
    file-2 = {Polynomial-Time Algorithms for Permutation Groups - a097825.pdf},
    numpages = {6},
    doi = {10.1109/SFCS.1980.34}
}

@inproceedings{10.1109/SFCS.1980.34, Abstract = {A permutation group on n letters may always be represented by a small set of generators, even though its size may be exponential in n. We show that it is practical to use such a representation since many problems such as membership testing, equality testing, and inclusion testing are decidable in polynomial time. In addition, we demonstrate that the normal closure of a subgroup can be computed in polynomial time, and that this proceaure can be used to test a group for solvability. We also describe an approach to computing the intersection of two groups. The procedures and techniques have wide applicability and have recently been used to improve many graph isomorphism algorithms.}, Address = {USA}, Author = {Furst, Merrick and Hopcroft, John and Luks, Eugene}, BookTitle = {Proceedings of the 21st Annual Symposium on Foundations of Computer Science}, File = {Polynomial-Time Algorithms for Permutation Groups - furst1980.pdf}, Pages = {36--41}, Publisher = {IEEE Computer Society}, Series = {SFCS '80}, Title = {Polynomial-Time Algorithms for Permutation Groups}, URL = {https://doi.org/10.1109/SFCS.1980.34}, Year = {1980}, bdsk-url-1 = {https://doi.org/10.1109/SFCS.1980.34}, date-added = {2021-04-06 15:02:53 +0200}, date-modified = {2021-04-06 15:02:53 +0200}, file-2 = {Polynomial-Time Algorithms for Permutation Groups - a097825.pdf}, numpages = {6}, doi = {10.1109/SFCS.1980.34} }