Computational linear algebra over finite fields

Abstract

We present here algorithms for efficient computation of linear algebra problems over finite fields.

References in corpus (2)

• Bitslicing and the Method of Four Russians Over Larger Finite Fields
• Simultaneous Modular Reduction and Kronecker Substitution for Small Finite Fields

Cited by in corpus (1)

• On a fast and nearly division-free algorithm for the characteristic polynomial