An Algorithm for Finding the Blocks of a Permutation Group
From MaRDI portal
Cited in
(13)- Effective computation with group homomorphisms
- Interpreting inequality measures in a Harsanyi framwork
- Computing the composition factors of a permutation group in polynomial time
- Ground resolution with group computations on semantic symmetries
- Solvability by radicals is in polynomial time
- Computing with groups and their character tables
- Isomorphism of graphs of bounded valence can be tested in polynomial time
- Algorithms for matrix groups and the Tits alternative
- On the existence of branched coverings between surfaces with prescribed branch data. I
- Extremal and game-theoretic characterizations of the probabilistic approach to income redistribution
- Efficient algorithmic learning of the structure of permutation groups by examples
- Parallel algorithms for solvable permutation groups
- Graph isomorphism problem
This page was built for publication: An Algorithm for Finding the Blocks of a Permutation Group
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q4068903)
