Abstract
Many problems in computational representation theory of finite groups require calculations with huge dense matrices over very small finite fields (cf. [5] and [7]). In this paper, we concentrate on matrix multiplication of matrices over GF(2) though most of the ideas can be generalized in some way to other matrix algorithms and to other small finite fields.
Talk to us
Join us for a 30 min session where you can share your feedback and ask us any queries you have