Pages that link to "Item:Q2640676"

The following pages link to Computing the structure of finite algebras (Q2640676):

Displaying 39 items.

• Splitting full matrix algebras over algebraic number fields. (Q448406) (← links)
• Computing Chevalley bases in small characteristics (Q731240) (← links)
• Testing isomorphism of modules. (Q959773) (← links)
• Effective descent for differential operators (Q984999) (← links)
• Computing the order of centralizers in linear groups (Q1174860) (← links)
• Lie algebraic computation (Q1294626) (← links)
• Using Cartan subalgebras to calculate nilradicals and Levi subalgebras of Lie algebras (Q1294789) (← links)
• Finding the radical of matrix algebras using Fitting decompositions (Q1295786) (← links)
• Finding maximal orders in semisimple algebras over \(\mathbb{Q}\) (Q1312180) (← links)
• Decomposition of algebras over \(F_ q(X_ 1,\dots,X_ m)\) (Q1320439) (← links)
• Finding the radical of an algebra of linear transformations (Q1358905) (← links)
• Efficient decomposition of separable algebras. (Q1432890) (← links)
• Computing explicit isomorphisms with full matrix algebras over \(\mathbb {F}_q(x)\) (Q1750386) (← links)
• Effective detection of nonsplit module extensions. (Q1779472) (← links)
• Computing Cartan subalgebras of Lie algebras (Q1924545) (← links)
• Efficient decomposition of associative algebras over finite fields (Q1976671) (← links)
• Explicit isomorphisms of quaternion algebras over quadratic global fields (Q2081528) (← links)
• Average-case linear matrix factorization and reconstruction of low width algebraic branching programs (Q2281256) (← links)
• A note on locality of algebras (Q2343500) (← links)
• Algorithmic properties of maximal orders in simple algebras over \(\mathbb{Q}\) (Q2366169) (← links)
• Cryptographic algorithms on groups and algebras (Q2399994) (← links)
• On isomorphism testing of groups with normal Hall subgroups (Q2637286) (← links)
• Trading GRH for algebra: Algorithms for factoring polynomials and related structures (Q3117221) (← links)
• Computing the Cassels–Tate pairing on the 3-Selmer group of an elliptic curve (Q3191225) (← links)
• Algorithms Based on *-Algebras, and Their Applications to Isomorphism of Polynomials with One Secret, Group Isomorphism, and Polynomial Identity Testing (Q4634059) (← links)
• From Independent Sets and Vertex Colorings to Isotropic Spaces and Isotropic Decompositions: Another Bridge between Graphs and Alternating Matrix Spaces (Q4994986) (← links)
• (Q5089246) (← links)
• Determinant Equivalence Test over Finite Fields and over Q (Q5091219) (← links)
• Testing Isomorphism of Lattices over CM-Orders (Q5232327) (← links)
• Computing isometry groups of Hermitian maps (Q5389416) (← links)
• Identifying the Matrix Ring: Algorithms for Quaternion Algebras and Quadratic Forms (Q5397112) (← links)
• Explicit $n$-descent on elliptic curves III. Algorithms (Q5496219) (← links)
• An identification system based on the explicit isomorphism problem (Q6080426) (← links)
• Exact hierarchical reductions of dynamical models via linear transformations (Q6121818) (← links)
• Two-closure of rank \(3\) groups in polynomial time (Q6170785) (← links)
• Formations of finite groups in polynomial time: \(\mathfrak{F}\)-residuals and \(\mathfrak{F}\)-subnormality (Q6184182) (← links)
• Hidden stabilizers, the isogeny to endomorphism ring problem and the cryptanalysis of pSIDH (Q6595808) (← links)
• Efficient algorithms for finite \(\mathbb{Z}\)-algebras (Q6601470) (← links)
• Efficient computations in central simple algebras using Amitsur cohomology (Q6667410) (← links)