(integer multiplication, not matrix multiplication, right?)

topaz0 41 minutes ago | parent | next [-]

I thought the nlogn^.9999 was for fft

It was both actually.

	▲	fph an hour ago \| parent [-]
		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).