Computing the Determinant via the Generalized Euclidean Algorithm
We present an algorithm with a natural geometric interpretation for computing the determinant of a matrix $B\in\mathbb{Z}^{d\times d}$. It improves upon the current fastest deterministic algorithms by a factor of $d^{\omega(1)+1-\omega(2)}\approx d^{0.1213}$, where $\omega(k)$ denotes the exponent required for multiply...