On the complexity of matrix reduction over finite fields (Q2467342)

The authors study the complexity of matrix elimination over finite fields in terms of row operations.They present an algorithm called ``striped matrix elimination'' which is asymptotically faster than traditional Gauss-Jordan elimination. They present results of a large computational study of complexities for small matrices and fields.Finally they give a conjecture on the behaviour of a natural analogue of GLn for semifields and prove this for a certain class of semifields