We examine a basic problem of what can be determined efficiently about the eigenvalues of a matrix in O(2n) given the traces of its first k (<n ) powers. We explain how this can be used to compute root numbers and count zeros of L functions, in sub exponential time (in the conductor). Joint work with M. Rubinstein.