Polynomial-time versions of Sylow's theorem

DOI10.1016/0196-6774(88)90002-8zbMath0642.20019OpenAlexW2001882515WikidataQ56092203 ScholiaQ56092203MaRDI QIDQ3784308

No author found.

Publication date: 1988

Published in: Journal of Algorithms (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1016/0196-6774(88)90002-8

zbMATH Keywords

permutation groupscomplementspolynomial time algorithmsSylow p-subgroups\(\pi \)-subgroups

Mathematics Subject Classification ID

Analysis of algorithms and problem complexity (68Q25) Sylow subgroups, Sylow properties, (pi)-groups, (pi)-structure (20D20) Software, source code, etc. for problems pertaining to group theory (20-04) Subgroups of symmetric groups (20B35)

Related Items (5)

Constructing normalisers in finite soluble groups ⋮ Parallel algorithms for solvable permutation groups ⋮ Computing in permutation and matrix groups. III: Sylow subgroups ⋮ Computing the composition factors of a permutation group in polynomial time ⋮ Sylow's theorem in polynomial time

This page was built for publication: Polynomial-time versions of Sylow's theorem