In this paper, an investigation of the parallel arithmetic complexity of matrix inversion, solving systems of linear equations, computing determinants and computing the characteristic polynomial of a matrix is reported. The parallel arithmetic complexity of solving equations has been an open question for several years. The gap between the complexity of the best algorithms (2n + 0(1), where n is the number of unknowns/ equations) and the only proved lower bound (2 log n (All logarithms in this paper are of base two.)) was huge. The first breakthrough came when Csanky reported that the parallel arithmetic complexity of all these four problems has the same growth rate and exhibited an algorithm that computes these problems in 2n - O(log2n) steps. It will be shown in the sequel that the parallel arithmetic complexity of all these four problems is upper bounded by O(log2n) and the algorithms that establish this bound use a number of processors polynomial in n. This disproves I. Munro's conjecture.