scientific article; zbMATH DE number 66617

zbMATH Open0747.68030MaRDI QIDQ4011250FDOQ4011250

Authors: László Babai 

Publication date: 27 September 1992

Title of this publication is not available (Why is that?)

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

zbMATH Keywords

permutation groupMonte Carlo algorithmnormal closurestrong generating setmembership testgenerating random group elements

Mathematics Subject Classification ID

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

Cited In (8)

• Deterministic polynomial factoring over finite fields: a uniform approach via \(\mathcal{P}\)-schemes
• Title not available (Why is that?)
• Finite groups and complexity theory: from Leningrad to Saint Petersburg via Las Vegas
• Title not available (Why is that?)
• Algorithms for matrix groups and the Tits alternative
• Computational complexity of immanents and representations of the full linear group
• Short presentations for finite groups
• Title not available (Why is that?)

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)