On a subclass of tame problems

Abstract

In representation theory, the problem of classifying pairs of matrices up to simultaneous similarity is used as a measure of complexity; classification problems containing it are called wild problems, and the other are referred to as tame.

arXiv commentThis paper has been withdrawn by the author. Some of the results are contained in another paper. Different approach to hardness was used, and therefore some of these results are irrelevant