Pages that link to "Item:Q4068903"
From MaRDI portal
The following pages link to An Algorithm for Finding the Blocks of a Permutation Group (Q4068903):
Displaying 13 items.
- Interpreting inequality measures in a Harsanyi framwork (Q580153) (← links)
- Computing the composition factors of a permutation group in polynomial time (Q581532) (← links)
- Computing with groups and their character tables (Q755890) (← links)
- Extremal and game-theoretic characterizations of the probabilistic approach to income redistribution (Q790701) (← links)
- On the existence of branched coverings between surfaces with prescribed branch data. I (Q863086) (← links)
- Graph isomorphism problem (Q1057883) (← links)
- Effective computation with group homomorphisms (Q1062134) (← links)
- Solvability by radicals is in polynomial time (Q1071803) (← links)
- Parallel algorithms for solvable permutation groups (Q1111023) (← links)
- Isomorphism of graphs of bounded valence can be tested in polynomial time (Q1168744) (← links)
- Algorithms for matrix groups and the Tits alternative (Q1288201) (← links)
- Efficient algorithmic learning of the structure of permutation groups by examples (Q1963029) (← links)
- Ground resolution with group computations on semantic symmetries (Q4647542) (← links)
