Strassen's Algorithm: Difference between revisions

Revision as of 00:46, 30 September 2009 view source Dank (talk \| contribs) Bureaucrats, Administrators 11,328 edits No edit summary ← Older edit		Revision as of 00:47, 30 September 2009 view source Dank (talk \| contribs) Bureaucrats, Administrators 11,328 edits No edit summary Newer edit →
Line 1:		Line 1:
	A matrix multiplication algorithm which replaces one recursive matrix multiplication with 18 matrix additions (compared to [[Winograd's Algorithm\|Winograd's]] 18), yielding O(n<sup>2.81</sup>) asymptotic performance.		A matrix multiplication algorithm which replaces one recursive matrix multiplication with 18 matrix additions (compared to [[Winograd's Algorithm\|Winograd's]] 18), yielding O(n<sup>2.81</sup>) asymptotic performance at the cost of some numeric stability.

	[[Category: Computer Science Eponyms]]		[[Category: Computer Science Eponyms]]