scientific article; zbMATH DE number 1273663

zbMATH Open0925.20011MaRDI QIDQ4237394FDOQ4237394

Authors: László Babai, Gene Cooperman, Larry Finkelstein, Ákos Seress 

Publication date: 24 August 1999

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

Recommendations

• A random base change algorithm for permutation groups
• Nearly linear time algorithms for permutation groups: An interplay between theory and practice
• scientific article; zbMATH DE number 1263364
• scientific article; zbMATH DE number 1004940

zbMATH Keywords

Monte Carlo algorithmsmembership teststime complexity boundspoint stabilizer chainssmall base permutation groups

Mathematics Subject Classification ID

Symbolic computation and algebraic computation (68W30)

Cited In (17)

• Title not available (Why is that?)
• Title not available (Why is that?)
• Title not available (Why is that?)
• Title not available (Why is that?)
• Fast computation of the centralizer of a permutation group in the symmetric group
• A Reduction Algorithm for Large-Base Primitive Permutation Groups
• Minimum bases for permutation groups: The greedy approximation
• A New Base Change Algorithm for Permutation Groups
• Title not available (Why is that?)
• Title not available (Why is that?)
• 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?)
• A random base change algorithm for permutation groups
• Efficient algorithmic learning of the structure of permutation groups by examples
• Title not available (Why is that?)
• 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 Q4237394)