Given an $n\times n$ matrix $A$ with rational entries. What's the complexity to check $A$ is diagonalizable?
I suspect that this can be done in P, but I do not know any reference. However, a more interesting question is, is there any better complexity class to capture this problem?
Any guidance/comment is welcome! Thanks.