scientific article; zbMATH DE number 1253966
From MaRDI portal
Publication:4226940
zbMath0918.16001MaRDI QIDQ4226940
Gábor Ivanyos, Marek Karpinski, Alexander L. Chistov
Publication date: 30 May 1999
Title: zbMATH Open Web Interface contents unavailable due to conflicting licenses.
finite-dimensional algebrasfinite fieldsnumber fieldspolynomial time algorithmsmodule isomorphism problemdirect sums of indecomposable modules
Symbolic computation and algebraic computation (68W30) Representations of orders, lattices, algebras over commutative rings (16G30) Matrices over special rings (quaternions, finite fields, etc.) (15B33) Computational aspects of associative rings (general theory) (16Z05)
Related Items (26)
Algorithms for Group Isomorphism via Group Extensions and Cohomology ⋮ Computation of lattice isomorphisms and the integral matrix similarity problem ⋮ On the Complexity of Isomorphism Problems for Tensors, Groups, and Polynomials I: Tensor Isomorphism-Completeness ⋮ Classical complexity and quantum entanglement ⋮ General linear group action on tensors: a candidate for post-quantum cryptography ⋮ Non-commutative Edmonds' problem and matrix semi-invariants ⋮ Exact hierarchical reductions of dynamical models via linear transformations ⋮ Ranks of linear matrix pencils separate simultaneous similarity orbits ⋮ Linear Representation of Graphs: Applications to Molecular Graphs ⋮ Two-closure of rank \(3\) groups in polynomial time ⋮ Matrix coefficient realization theory of noncommutative rational functions ⋮ The graph isomorphism problem and approximate categories ⋮ Splitting full matrix algebras over algebraic number fields. ⋮ The module isomorphism problem reconsidered. ⋮ Subspace Arrangements, Graph Rigidity and Derandomization Through Submodular Optimization ⋮ Algorithms Based on *-Algebras, and Their Applications to Isomorphism of Polynomials with One Secret, Group Isomorphism, and Polynomial Identity Testing ⋮ Matrix method for persistence modules on commutative ladders of finite type ⋮ Testing isomorphism of modules. ⋮ On the normal forms of modules with respect to parametrizing bimodules. ⋮ Unnamed Item ⋮ Noncommutative polynomials describing convex sets ⋮ Persistence modules on commutative ladders of finite type ⋮ Determinant Equivalence Test over Finite Fields and over Q ⋮ Trading GRH for algebra: Algorithms for factoring polynomials and related structures ⋮ Polynomial-time algorithms for quadratic isomorphism of polynomials: the regular case ⋮ Generalized Wong sequences and their applications to Edmonds' problems
This page was built for publication:
