This paper describes an algorithm which computes the characteristic polynomial of a matrix over field within same asymptotic complexity, up to constant factors, as multiplication two square matrices. Previously, this was only achieved by resorting genericity assumptions or randomization techniques, while best known complexity bound with general deterministic obtained Keller-Gehrig in 1985 and i...