Hacker Newsnew | past | comments | ask | show | jobs | submitlogin

"Perfect" in this case is a qualitative exaggeration bordering on hyperbole.

> At the end of February, a team of computer scientists at Aarhus University posted a paper arguing that if another unproven conjecture is also true, this is indeed the fastest way multiplication can be done.



I would say it's firmly hyperbole/clickbait, upon further investigation.


I think it’s fair. Nobody thinks a faster algorithm than n log n will ever be possible. It’s like a mini P!=NP.


You don't know what nobody thinks, because there may be a person that thinks just that. This is an active area of research. Anything quicker than O(nlog n) but slower than O(n) is still possible.




Guidelines | FAQ | Lists | API | Security | Legal | Apply to YC | Contact

Search: