scientific article; zbMATH DE number 1253966
From MaRDI portal
Publication:4226940
Recommendations
- Testing isomorphism of modules.
- The module isomorphism problem reconsidered.
- Computation of lattice isomorphisms and the integral matrix similarity problem
- Computing explicit isomorphisms with full matrix algebras over \(\mathbb {F}_q(x)\)
- The multiplicity problem for indecomposable decompositions of modules over a finite-dimensional algebra. Algorithms and a computer algebra approach
Cited in
(44)- A polynomial time algorithm to compute the Abelian kernel of a finite monoid
- Matrix coefficient realization theory of noncommutative rational functions
- Matrix method for persistence modules on commutative ladders of finite type
- Computing explicit isomorphisms with full matrix algebras over \(\mathbb {F}_q(x)\)
- Classical complexity and quantum entanglement
- Noncommutative polynomials describing convex sets
- Tensor isomorphism by conjugacy of Lie algebras
- General linear group action on tensors: a candidate for post-quantum cryptography
- On the normal forms of modules with respect to parametrizing bimodules.
- Polynomial-time algorithms for quadratic isomorphism of polynomials: the regular case
- Generalized Wong sequences and their applications to Edmonds' problems
- Non-commutative Edmonds' problem and matrix semi-invariants
- The graph isomorphism problem and approximate categories
- Ranks of linear matrix pencils separate simultaneous similarity orbits
- On the multiplicity problem and the isomorphism problem for the four subspace algebra
- Trading GRH for algebra: algorithms for factoring polynomials and related structures
- Subspace arrangements, graph rigidity and derandomization through submodular optimization
- The multiplicity problem for indecomposable decompositions of modules over a finite-dimensional algebra. Algorithms and a computer algebra approach
- Splitting full matrix algebras over algebraic number fields.
- Algorithms based on -algebras, and their applications to isomorphism of polynomials with one secret, group isomorphism, and polynomial identity testing
- Algorithms based on \(*\)-algebras, and their applications to isomorphism of polynomials with one secret, group isomorphism, and polynomial identity testing
- The module isomorphism problem reconsidered.
- scientific article; zbMATH DE number 1415872 (Why is no real title available?)
- Computation of lattice isomorphisms and the integral matrix similarity problem
- Determinant Equivalence Test over Finite Fields and over Q
- Approximations of isomorphism and logics with linear-algebraic operators
- A polynomial time algorithm for computing the HNF of a module over the integers of a number field
- Algorithms for group isomorphism via group extensions and cohomology
- On the computational complexity of Bongartz's algorithm
- On the Complexity of Isomorphism Problems for Tensors, Groups, and Polynomials I: Tensor Isomorphism-Completeness
- Persistence modules on commutative ladders of finite type
- Exact hierarchical reductions of dynamical models via linear transformations
- Linear Representation of Graphs: Applications to Molecular Graphs
- Two-closure of rank \(3\) groups in polynomial time
- Invariant Grassmannians and a K3 surface with an action of order 192*2
- Group factorisation for smaller signatures from cryptographic group actions
- Testing isomorphism between tuples of subspaces
- Testing equivalence to design polynomials
- Learning arithmetic formulas in the presence of noise: a general framework and applications to unsupervised learning
- On p-group isomorphism: search-to-decision, counting-to-decision and nilpotency class reductions via tensors
- On the complexity of isomorphism problems for tensors, groups, and polynomials. I: Tensor isomorphism-completeness
- Linear algebraic quantifiers
- Decomposing multiparameter persistence modules
- Testing isomorphism of modules.
This page was built for publication:
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q4226940)
