Journal of Soviet Mathematics

, Volume 22, Issue 3, pp 1285–1289

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

  • Authors
  • D. Yu. Grigor'ev

DOI: 10.1007/BF01084390

Cite this article as:
Grigor'ev, D.Y. J Math Sci (1983) 22: 1285. doi:10.1007/BF01084390


It is shown that isomorphism of semisimple algebras over an algebraically closed field is recognized in polynomial time. The polynomial equivalence of isomorphism of graphs and isomorphism of algebras (over an algebraically closed field) with zero square of the radical and commutative quotient modulo the radical is proved. A series of problems about the complexity of matrix problems and isomorphism of algebras are posed.

Copyright information

© Plenum Publishing Corporation 1983