Yhn first seen 2 d ago, last 2 d ago, peak #22
Integer multiplication achieved below n log n complexity
Original: Auto Research: Integer multiplication below n log n
A new result claims integer multiplication can be performed in time below n log n, long regarded as a natural barrier after recent advances had only approached that bound. The claim is circulating among programmers and theoretical computer science enthusiasts, who are debating whether the analysis is sound and what it would mean for the practical speed of basic arithmetic on very large numbers.
Why now: A claimed breakthrough against a long-standing theoretical bound for a fundamental algorithm naturally draws scrutiny and debate.
integer multiplicationn log n barrieralgorithm complexity
Rank over time, top of the chart is #1. 54 snapshots from 2 d ago to 2 d ago.
Evidence
- Auto Research: Integer multiplication below n log n · swesnow · 74
API: https://socialmediatrends-api.osmike.com/v1/trends/2047246