We compare the constant term of the minimal polynomial with the constant term of the characteristic polynomial. The latter is known to be computable in the logspace counting class GapL. We show that this holds also for the minimal polynomial if and only if the

As an application of our techniques
we show that the problem to decide whether
a matrix is diagonalizable is complete
for AC^{0}(C=L), the AC^{0}-closure of C=L.