Researchers debate whether an n(log n)^a integer-multiplication result was misread
rrwilliams · x · 2026-10-13
A technical dispute over algorithmic complexity: the author argues a claim of changing 'superpolynomially many' bits in one step is wrong, since a single step can only flip a fixed constant number of bits. He then clarifies there are two n(log n)^a results with a<1 — one a discrete FFT result computing integer multiplication, the other a complex version he had not seen. A substantive theory/CS discussion.
More from Research
- World model research: more data won't suffice—squeeze more from it; even intuitive physics is still out of reach — mangahomanga · 2026-10-13
- Indie dev builds own serving library to train SVG model, finds evolution loses to SGD — cephaloform · 2026-10-13
- Harvard & NTT Research: cooperating AI agent populations hit an Allee-effect takeoff threshold — Hidenori8Tanaka · 2026-10-13
- RT-Super trains tumor segmentation from radiology reports, lifting Dice from 16 to 30 without masks — maier_ak · 2026-10-13
- Princeton's QUEEN: a 4B model that plays grandmaster-level chess and explains its moves in plain language — jiqizhixin · 2026-10-13
- Oxford shows neural nets can be encrypted inside model weights, surviving 500 SFT steps — zainhas · 2026-10-13