![Screenshot of web.maths.unsw.edu.au: The recently proposed o(n log n) integer multiplication algorithm [pdf]](https://hn.urlbox.com/shots/renders/2026/10/22/031b3473-91fb-4202-9bf2-aa9a7fb3e59c.jpg)
The recently proposed o(n log n) integer multiplication algorithm [pdf](web.maths.unsw.edu.au)
295 points by craigcitro | 290 comments
A PDF by David Harvey (UNSW) on the recently proposed O(n log n) algorithm for integer multiplication.
#computational-complexity on Hacker News
5 stories tagged computational-complexity, newest first.
Κ = 0.003 for integer multiplication crossed(github.com)
31 points by aleph_minus_one | 22 comments
A GitHub pull request in CrocSwap/integer-mult-bounds claiming a conditional integer multiplication bound O(n (log n)^(1-0.00300105)) by combining query thinning and helper retiming.
Integer multiplication below n log n(github.com)
88 points by E-Reverance | 59 comments
GitHub directory in OpenAI's math repository containing a preprint paper and README on integer multiplication algorithms faster than n log n.
Michael Rabin has died(en.wikipedia.org)
402 points by tkhattra | 82 comments
Wikipedia biography of Michael O. Rabin, Israeli mathematician and computer scientist, 1976 Turing Award co-recipient, who died April 14, 2026.
Missile defense is NP-complete(smu160.github.io)
353 points by O3marchnative | 367 comments
Blog post arguing that allocating missile interceptors is an NP-complete resource allocation problem, starting with single-shot kill probability of interceptors.