What's up in
Complexity Theory’s 50-Year Journey to the Limits of Knowledge
How hard is it to prove that problems are hard to solve? Meta-complexity theorists have been asking questions like this for decades. A string of recent results has started to deliver answers.
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.
Mathematicians Complete Quest to Build ‘Spherical Cubes’
Is it possible to fill space “cubically” with shapes that act like spheres? A proof at the intersection of geometry and theoretical computer science says yes.
The Computer Scientist Who Finds Life Lessons in Games
In Shang-Hua Teng’s work, theoretical and practical questions have long been intertwined. Now he’s turning his focus to the impractical.