Matrix multiplication over word-size modular rings using approximate formulae

International audienceBini–Capovani–Lotti–Romani approximate formula (or border rank) for matrix multiplication achieves abetter complexity than Strassen’s matrix multiplication formula. In this paper, we show a novel way touse the approximate formula in the special case where the ring is Z/pZ. Besides, we show an implementation à la FFLAS–FFPACK, where p is a word-size modulo, that improves on state-of-the-art Z/pZ matrix multiplication implementations