Discrete combinatorial optimization has a central role in many scientific disciplines, however, for hard problems we lack linear time algorithms that would allow us to solve very large instances.

On Thursday, Simon Meierhans – a member of Kyng’s team – presented a new almost-linear-time algorithm at the Annual ACM Symposium on Theory of Computing (STOC) in Vancouver. This algorithm solves the ...

New quantum algorithm can solve monster-size equations. ... It tackles linear equations: ... by computer. Still, calculation time grows at least as fast as N does: if N gets 1,000 times larger, ...