Complexity theorists sort problems into categories, called complexity classes, based on the resource demands of the best algorithms for solving them — that is, the algorithms that run fastest or use ...

Until now, the only known algorithms for accomplishing certain tasks required an amount of space roughly proportional to their run time, and researchers had long assumed there’s no way to do better.

Now, a new study shows that time and space in computational terms have a similarly complicated relationship. Of course, computer scientists aren’t concerned with the fabric of space-time that ...