logoalt Hacker News

qingcharlestoday at 3:13 AM1 replyview on HN

Amazed I hadn't heard of this before. Would be interesting to see if they can prove that they have discovered the fastest at O(n × log n) or whether there is more still to come.


Replies

pfdietztoday at 4:32 AM

Lower bounds are really hard.