Pages that link to "Item:Q5172698"

The following pages link to Polynomial-time theory of matrix groups (Q5172698):

Displaying 28 items.

• Black box exceptional groups of Lie type. II. (Q468723) (← links)
• A practical model for computation with matrix groups. (Q480641) (← links)
• Linear decomposition method in analyzing hidden information protocols on algebraic platforms (Q498303) (← links)
• Recognising simplicity of black-box groups by constructing involutions and their centralisers. (Q606645) (← links)
• Random generation of finite and profinite groups and group enumeration. (Q640754) (← links)
• Computing the order of centralizers in linear groups (Q1174860) (← links)
• The use of permutation representations in structural computations in large finite matrix groups (Q2000260) (← links)
• General linear group action on tensors: a candidate for post-quantum cryptography (Q2175914) (← links)
• Constructing composition factors for a linear group in polynomial time (Q2193255) (← links)
• Linear groups and computation (Q2292421) (← links)
• The hidden subgroup problem and MKTP (Q2330111) (← links)
• Computing conjugacy classes of elements in matrix groups. (Q2438900) (← links)
• Recognising the Suzuki groups in their natural representations. (Q2496861) (← links)
• Polynomial-time solutions of computational problems in noncommutative-algebraic cryptography (Q2516526) (← links)
• Deterministic algorithms for management of matrix groups. (Q2759635) (← links)
• Finite Groups and Complexity Theory: From Leningrad to Saint Petersburg via Las Vegas (Q3007625) (← links)
• Minimum Circuit Size, Graph Isomorphism, and Related Problems (Q3176189) (← links)
• (Q3792861) (← links)
• Bounded Round Interactive Proofs in Finite Groups (Q3989015) (← links)
• (Q4234184) (← links)
• (Q4335290) (← links)
• From Independent Sets and Vertex Colorings to Isotropic Spaces and Isotropic Decompositions: Another Bridge between Graphs and Alternating Matrix Spaces (Q4994986) (← links)
• (Q5005126) (← links)
• Algorithms for Group Isomorphism via Group Extensions and Cohomology (Q5283241) (← links)
• On the Complexity of Isomorphism Problems for Tensors, Groups, and Polynomials I: Tensor Isomorphism-Completeness (Q5890037) (← links)
• The membership problem for subsemigroups of \(\operatorname{GL}_2(\mathbb{Z})\) is \textbf{NP}-complete (Q6178465) (← links)
• Calculating subgroups with GAP (Q6599585) (← links)
• Efficient quantum algorithms for some instances of the semidirect discrete logarithm problem (Q6618613) (← links)