scientific article; zbMATH DE number 66617

MaRDI QIDQ4011250zbMATH OpenFDO

Authors László Babai

Publication date 27 September 1992

zbMATH Keywords

generating random group elementsmembership testMonte Carlo algorithmnormal closurepermutation groupstrong generating set

Mathematics Subject Classification ID

Generators, relations, and presentations of groups (20F05) Modes of computation (nondeterministic, parallel, interactive, probabilistic, etc.) (68Q10) Complexity classes (hierarchies, relations among complexity classes, etc.) (68Q15) Analysis of algorithms and problem complexity (68Q25)

Recommendations

• scientific article; zbMATH DE number 77937
• Simple groups in computational group theory
• scientific article; zbMATH DE number 96388
• A strong generating test and short presentations for permutation groups
• scientific article; zbMATH DE number 3989617

Cited in

(9)

• Simple groups in computational group theory
• Algorithms for matrix groups and the Tits alternative
• Short presentations for finite groups
• Deterministic polynomial factoring over finite fields: a uniform approach via \(\mathcal{P}\)-schemes
• Finite groups and complexity theory: from Leningrad to Saint Petersburg via Las Vegas
• scientific article; zbMATH DE number 3877408 (Why is no real title available?)
• scientific article; zbMATH DE number 475370 (Why is no real title available?)
• scientific article; zbMATH DE number 919272 (Why is no real title available?)
• Computational complexity of immanents and representations of the full linear group

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 Q4011250)