What's up in
A recent paper set the fastest record for multiplying two matrices. But it also marks the end of the line for a method researchers have relied on for decades to make improvements.
By harnessing randomness, a new algorithm achieves a fundamentally novel — and faster — way of performing one of the most basic computations in math and computer science.
A landmark proof in computer science has also solved an important problem called the Connes embedding conjecture. Mathematicians are working to understand it.