On computing the determinant in small parallel time using a small number of processors

Abstract

The determinant, characteristic polynomial and adjoint over an arbitrary commutative ring with unity can be computed by a circuit with size O(n 3.496) and depth O(log 2n). Furthermore, the circuits can be constructed uniformly (by a log space bounded Turing machine).