What's up in
Researchers Refute a Widespread Belief About Online Algorithms
Three computer scientists have disproved a long-standing conjecture about a fundamental problem involving imperfect information.
Thirty Years Later, a Speed Boost for Quantum Factoring
Shor’s algorithm will enable future quantum computers to factor large numbers quickly, undermining many online security protocols. Now a researcher has shown how to do it even faster.
Risky Giant Steps Can Solve Optimization Problems Faster
New results break with decades of conventional wisdom for the gradient descent algorithm.
To Move Fast, Quantum Maze Solvers Must Forget the Past
Quantum algorithms can find their way out of mazes exponentially faster than classical ones, at the cost of forgetting the path they took. A new result suggests that the trade-off may be inevitable.
Computer Scientists Inch Closer to Major Algorithmic Goal
A new paper finds a faster method for determining when two mathematical groups are the same.