Tag
David Harvey and Joris van der Hoeven's paper presenting a groundbreaking O(n log n) integer multiplication algorithm, breaking the long-standing complexity barrier for multiplying large integers.
A community research repository reports a sharper exponent bound for integer multiplication, achieving T(n)=O(n(log n)^(1-κ)) with κ=0.0023 under the OpenAI #109 framework, conditional on unverified hypotheses and not yet a complete Lean proof.
An automated research run exploring integer multiplication algorithms with complexity below n log n, providing reproducible contributions, a repository contribution guide, and interactive visualization of ideas and pull requests.
Daniel Lemire explores what fraction of 64-bit integers can be expressed as the product of two 32-bit integers, finding that only about 17% are, with implications for hash function design.