Abstractions blog A New Algorithm for Graph Crossings, Hiding in Plain Sight Two computer scientists found — in the unlikeliest of places — just the idea they needed to make a big leap in graph theory ...

By eliminating a hidden inefficiency, computer scientists have come up with a new way to multiply large matrices that’s faster than ever.