scientific article; zbMATH DE number 434875

zbMATH Open0829.20009MaRDI QIDQ3139727FDOQ3139727

Author name not available (Why is that?)

Publication date: 15 January 1996

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

zbMATH Keywords

algorithmsregularitygenerating setstime complexitypermutation groups

Mathematics Subject Classification ID

Analysis of algorithms and problem complexity (68Q25) Combinatorics in computer science (68R05) Generators, relations, and presentations of groups (20F05)

Cited In (2)

• An improvement to the centralizer algorithm for permutation groups
• Proportions of \(r\)-regular elements in finite classical groups.

   Recommendations

• A strong generating test and short presentations for permutation groups 👍 👎
• Title not available (Why is that?) 👍 👎
• Title not available (Why is that?) 👍 👎
• Nearly linear time algorithms for permutation groups: An interplay between theory and practice 👍 👎
• A random base change algorithm for permutation groups 👍 👎

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