scientific article; zbMATH DE number 4165152

MaRDI QIDQ3491799zbMATH OpenFDO

Authors Kenneth D. Blaha

Publication date 1987

zbMATH Keywords

generatorsminimum baseNP-completeNP-hardpermutation grouppolynomial-time greedy algorithm

Mathematics Subject Classification ID

Generators, relations, and presentations of groups (20F05) Analysis of algorithms and problem complexity (68Q25)

Recommendations

• Minimum bases for permutation groups: The greedy approximation
• scientific article; zbMATH DE number 1273663
• Linear optimization over permutation groups
• scientific article; zbMATH DE number 3900155
• The parameterized complexity of fixpoint free elements and bases in permutation groups

Cited in

(8)

• Linear optimization over permutation groups
• On relational complexity and base size of finite primitive groups
• The parameterized complexity of fixpoint free elements and bases in permutation groups
• The distance of a permutation from a subgroup of S_n.
• scientific article; zbMATH DE number 3900155 (Why is no real title available?)
• Minimum bases for permutation groups: The greedy approximation
• The Complexity of Quasigroup Isomorphism and the Minimum Generating Set Problem
• Computational group theory: bedrock and new frontiers

This page was built for publication:

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q3491799)