> but O(n^2.807) time on a classical computer Optimizing matrix multiplication for classical computers is an open research problem, and according to wikipedia

> but O(n^2.807) time on a classical computer Optimizing matrix multiplication for classical computers is an open research problem, and according to wikipedia there are algorithms with O(n^2.37) running time. Also according to wikipedia, it is not proven that matrix multiplication can't be done in O(n^2).