Complexity of integer multiplication almost solved
Complex Projective 4-Space 2019-08-20
Summary:
Whilst not quite as close as the proofs of the ternary Goldbach conjecture and bounded gaps between primes, there has been a quick succession of two important and somewhat complementary breakthroughs on the computational complexity of integer multiplication: Afshani, Freksen, … Continue reading →