Strassen's algorithm is a divide and conquer algorithm for multiplying two square matrices of dimension n by n where n is a power of 2. The runtime is O(n^log_2(7)) which beats the naive O(n^3) ...

A few months ago, I had the pleasure of tuning into the Modular AI 2023 product release keynote. It was a riveting experience, filled with anticipation and excitement, especially when the fast Matrix ...

Asymptotically Fast Polynomial Multiplication In this video, our recent Mathematics and Computer science graduate Will Cashman talks about fast methods of polynomial multiplication - what it is, why ...

Abstract: In this paper, efficient one-dimensional (1-D) fast integer transform algorithms of the DCT matrix for the H.265 standard are proposed. Based on the symmetric property of the integer ...

"All things are numbers," avowed Pythagoras. Today, 25 centuries later, algebra and mathematics are everywhere in our lives, whether we see them or not. The Cambrian-like explosion of artificial ...