Asymptotic Complexity
AssessTechniques
A way to describe how an algorithm’s runtime grows as input size increases.
Why it's here
Placed in Assess: 1 article(s) of evidence from 1 source(s), led by research-stage coverage, with 1 in the last 30 days. Confidence 24%. Low accumulated evidence, so it defaults conservatively pending more signal.
Evidence (1)
- 6Hacker News·10/22/2026researchProposed O(n log n) Integer Multiplication Algorithm
A research paper proposes a new integer multiplication algorithm with asymptotic complexity of O(n log n). The work is notable because it targets a long-studied fundamental operation in computer science and mathematics, though it is still a research result rather than a deployed system. Discussion on Hacker News centers on the algorithm’s theoretical significance and practical implications.