One may consider that the algebraic complexity of basic linear algebra over an abstract field K is well known. Indeed, if ω is the exponent of matrix multiplication over K, then for instance computing the determinant, the matrix inverse, the rank or the characteristic polynomial of an n×n matrix over K can be done in O (̃n) operations in K. Here the soft “O” notation indicates some missing logar...
