The following pages link to (Q4226940):
Displaying 30 items.
- Splitting full matrix algebras over algebraic number fields. (Q448406) (← links)
- The module isomorphism problem reconsidered. (Q468724) (← links)
- Testing isomorphism of modules. (Q959773) (← links)
- A polynomial time algorithm to compute the Abelian kernel of a finite monoid (Q1402910) (← links)
- Matrix coefficient realization theory of noncommutative rational functions (Q1703103) (← links)
- Matrix method for persistence modules on commutative ladders of finite type (Q1736464) (← links)
- Classical complexity and quantum entanglement (Q1886316) (← links)
- Noncommutative polynomials describing convex sets (Q2031064) (← links)
- General linear group action on tensors: a candidate for post-quantum cryptography (Q2175914) (← links)
- On the normal forms of modules with respect to parametrizing bimodules. (Q2253036) (← links)
- Polynomial-time algorithms for quadratic isomorphism of polynomials: the regular case (Q2349096) (← links)
- Generalized Wong sequences and their applications to Edmonds' problems (Q2353409) (← links)
- Non-commutative Edmonds' problem and matrix semi-invariants (Q2410690) (← links)
- The graph isomorphism problem and approximate categories (Q2437326) (← links)
- Ranks of linear matrix pencils separate simultaneous similarity orbits (Q2684535) (← links)
- Trading GRH for algebra: Algorithms for factoring polynomials and related structures (Q3117221) (← links)
- Subspace Arrangements, Graph Rigidity and Derandomization Through Submodular Optimization (Q3295273) (← links)
- The multiplicity problem for indecomposable decompositions of modules over a finite-dimensional algebra. Algorithms and a computer algebra approach (Q3414752) (← links)
- Algorithms Based on *-Algebras, and Their Applications to Isomorphism of Polynomials with One Secret, Group Isomorphism, and Polynomial Identity Testing (Q4634059) (← links)
- Computation of lattice isomorphisms and the integral matrix similarity problem (Q5041469) (← links)
- Determinant Equivalence Test over Finite Fields and over Q (Q5091219) (← links)
- (Q5091274) (← links)
- A polynomial time algorithm for computing the HNF of a module over the integers of a number field (Q5244519) (← 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)
- Persistence modules on commutative ladders of finite type (Q5964222) (← links)
- Exact hierarchical reductions of dynamical models via linear transformations (Q6121818) (← links)
- Linear Representation of Graphs: Applications to Molecular Graphs (Q6167496) (← links)
- Two-closure of rank \(3\) groups in polynomial time (Q6170785) (← links)
- Invariant Grassmannians and a K3 surface with an action of order 192*2 (Q6671800) (← links)
