Talk:Computational complexity of matrix multiplication: Difference between revisions

Revision as of 12:09, 28 January 2024

Revision as of 10:44, 18 December 2024

Line 22:

:It's probably sufficiently notable, but it has no direct implications on the matrix multiplication exponent. There's currently no section about matrix multiplication algorithms in various bases, which would be a good place to put it. [[User:Fawly|Fawly]] ([[User talk:Fawly|talk]]) 04:28, 27 November 2022 (UTC)

== Feasible matrix multiplication, vs galactic algorithms ==

The article contained nothing about galactic size algorithms and that there are also available usable ones. I added sentence about it, but is was (not) corrected, but changed to:

"On the opposite, above Strassen's algorithm of 1969, and Pan's algorithm of 1978, whose respective exponents are slightly above and below 2.78 have constant coefficients that make them feasible."

Above sentence in its very language layer does not make a sense at all. Also scientifically does not.

I AM RISING IT, BECAUSE MR D.LAZARD CHANGED MY INITIAL, SENSIBLE VERSION, TO NON-SENSE. AND AT MY PERSONAL SITE MR D.LAZARD WRITES THAT IT SHOULD BE DELETED.

To repeat what D Lazard wrote: "above and below 2.78 have constant coefficients that make them feasible.". What does it mean ???? Thus I suggest Mr Lazard not insinuate to delete my personal page. It should be augmented, ok. [[User:Jerzy.Respondek|Jerzy.Respondek]] ([[User talk:Jerzy.Respondek|talk]]) 10:44, 18 December 2024 (UTC)