Complexity of wild matrix problems and of isomorphism of algebras and graphs

DOI10.1007/BF01084390zbMath0509.68030MaRDI QIDQ1838291

Dima Yu. Grigoriev

Publication date: 1983

Published in: Journal of Soviet Mathematics (Search for Journal in Brave)

zbMATH Keywords

polynomial complexitysemisimple algebragraph isomorphismisomorphism of algebrasradical of algebrawild matrix problem

Mathematics Subject Classification ID

Analysis of algorithms and problem complexity (68Q25) Module categories in associative algebras (16D90) Structure and classification for modules, bimodules and ideals (except as in 16Gxx), direct sum decomposition and cancellation in associative algebras) (16D70) Graphs and linear algebra (matrices, eigenvalues, etc.) (05C50) Canonical forms, reductions, classification (15A21)

Related Items (3)

On the Complexity of Isomorphism Problems for Tensors, Groups, and Polynomials I: Tensor Isomorphism-Completeness ⋮ Authentication schemes from actions on graphs, groups, or rings ⋮ Graph isomorphism problem

Cites Work

• Unnamed Item
• On incidence rings
• On Computing the Exact Determinant of Matrices with Polynomial Entries
• The Exact Solution of Systems of Linear Equations with Polynomial Coefficients

This page was built for publication: Complexity of wild matrix problems and of isomorphism of algebras and graphs