Minimum bases for permutation groups: The greedy approximation
From MaRDI portal
Publication:3990610
DOI10.1016/0196-6774(92)90020-DzbMath0746.20003MaRDI QIDQ3990610
Publication date: 28 June 1992
Published in: Journal of Algorithms (Search for Journal in Brave)
greedy algorithmpermutation groupsminimum basesstrong generating set\(NP\)-hardchain of stabilizersnonredundant bases
Lua error in Module:PublicationMSCList at line 37: attempt to index local 'msc_result' (a nil value).
Related Items (13)
A proof of Pyber's base size conjecture ⋮ Bases for permutation groups and matroids ⋮ On relational complexity and base size of finite primitive groups ⋮ ON THE HEIGHT AND RELATIONAL COMPLEXITY OF A FINITE PERMUTATION GROUP ⋮ On the Burness-Giudici conjecture ⋮ Permutation representations of loops. ⋮ Minimal degree, base size, order: selected topics on primitive permutation groups ⋮ Base sizes of primitive groups of diagonal type ⋮ Computational group theory. Abstracts from the workshop held August 15--21, 2021 (hybrid meeting) ⋮ Base sizes for primitive groups with soluble stabilisers ⋮ Permutation codes ⋮ On the Saxl graph of a permutation group ⋮ Finding fixed point free elements and small bases in permutation groups
This page was built for publication: Minimum bases for permutation groups: The greedy approximation
