Approximate Algorithm

AbstractBini’s approximate formula (or border rank) for matrix multiplicationachieves a better complexity than Strassen’s matrix multiplication formula.We show a novel way to use the approximate formula in the special casewhere the ring is Z/pZ. Besides, we show an implementation à la FFLAS– FFPACK [4] where p is a word-size modulo, that improves on state-of-the-artZ/pZ matrix multiplication implementations