A Sublinear Time Randomized Algorithm for Coset Enumeration in the Black Box Model

DOI10.1007/978-3-540-69733-6_9MaRDI QIDQ3511316zbMATH OpenOpenAlexFDO

Authors Bin Fu, Zhi-Xiang Chen

Publication date 10 July 2008

Published in Lecture Notes in Computer Science (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1007/978-3-540-69733-6_9

Mathematics Subject Classification ID

Randomized algorithms (68W20) Symbolic computation and algebraic computation (68W30)

Recommendations

• scientific article; zbMATH DE number 96387
• Fast Monte Carlo algorithms for permutation groups
• scientific article; zbMATH DE number 3968860
• A random base change algorithm for permutation groups
• scientific article; zbMATH DE number 1284153

Cites work

• Generating random elements of a finite group
• scientific article; zbMATH DE number 3769860 (Why is no real title available?)
• scientific article; zbMATH DE number 3511563 (Why is no real title available?)
• scientific article; zbMATH DE number 534859 (Why is no real title available?)
• scientific article; zbMATH DE number 3191321 (Why is no real title available?)
• Implementation and Analysis of the Todd-Coxeter Algorithm
• Introduction to algorithms

This page was built for publication: A Sublinear Time Randomized Algorithm for Coset Enumeration in the Black Box Model

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