Complexity of “wild” matrix problems and of isomorphism of algebras and graphs
- 17 Downloads
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.
Unable to display preview. Download preview PDF.