Pages that link to "Item:Q1892223"

The following pages link to Fast Monte Carlo algorithms for permutation groups (Q1892223):

Displaying 20 items.

• Black box exceptional groups of Lie type. II. (Q468723) (← links)
• Recognising simplicity of black-box groups by constructing involutions and their centralisers. (Q606645) (← links)
• Quantum property testing of group solvability (Q627520) (← links)
• A polynomial-time reduction algorithm for groups of semilinear or subfield class. (Q731236) (← links)
• Computing the order of a solvable permutation group (Q913945) (← links)
• Normalizers of \(p\)-subgroups in finite groups. (Q1016491) (← links)
• An algorithm for solving the factorization problem in permutation groups (Q1264436) (← links)
• Algorithms for matrix groups and the Tits alternative (Q1288201) (← links)
• Solvable black-box group problems are low for PP (Q1390854) (← links)
• Constructive recognition of finite alternating and symmetric groups acting as matrix groups on their natural permutation modules. (Q2577534) (← links)
• Linear time algorithms for Abelian group isomorphism and related problems (Q2643019) (← links)
• Finite Groups and Complexity Theory: From Leningrad to Saint Petersburg via Las Vegas (Q3007625) (← links)
• Quantum algorithms for algebraic problems (Q3077033) (← links)
• Constructive membership in black-box groups (Q3544292) (← links)
• (Q4787523) (← links)
• (Q5005126) (← links)
• Testing commutativity of a group and the power of randomization (Q5169624) (← links)
• Quantum Algorithms for a Set of Group Theoretic Problems (Q5261611) (← links)
• Constructive recognition of 𝑃𝑆𝐿(2,𝑞) (Q5713172) (← links)
• Complexity limitations on one-turn quantum refereed games (Q6038714) (← links)