<p>Given a matrix $A$ with rational entries, how to check whether all the eigenvalues of $A$ are  rational? </p>

<p>What's the complexity of this problem? It seems that this can be done in polynomial time, but is there a tighter upper bound?</p>

<cc.complexity-theory><linear-algebra><matrices>
compleixty of rational checking of eigenvalues
maomao
# compleixty of rational checking of eigenvalues

(Asked by: username_0 on 2014-01-08)

Given a matrix $A$ with rational entries, how to check whether all the eigenvalues of $A$ are rational?

What's the complexity of this problem? It seems that this can be done in polynomial time, but is there a tighter upper bound?

**Tags:** cc.complexity-theory, linear-algebra, matrices


---

## 0 answers

