← Back to context Comment by kevinwang 2 hours ago (integer multiplication, not matrix multiplication, right?) 3 comments kevinwang Reply topaz0 1 minute ago I thought the nlogn^.9999 was for fft AnotherGoodName 1 hour ago It was both actually. fph 11 minutes ago No. They have a new upper bound for matrix multiplication, but it's O(n^2.25). You can't do less than n^2 for obvious reasons (size of the input and output).
AnotherGoodName 1 hour ago It was both actually. fph 11 minutes ago No. They have a new upper bound for matrix multiplication, but it's O(n^2.25). You can't do less than n^2 for obvious reasons (size of the input and output).
fph 11 minutes ago No. They have a new upper bound for matrix multiplication, but it's O(n^2.25). You can't do less than n^2 for obvious reasons (size of the input and output).
I thought the nlogn^.9999 was for fft
It was both actually.
No. They have a new upper bound for matrix multiplication, but it's O(n^2.25). You can't do less than n^2 for obvious reasons (size of the input and output).