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.

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 ...

Complexity Theory and Polynomial Time Algorithms Publication Trend The graph below shows the total number of publications each year in Complexity Theory and Polynomial Time Algorithms.

Theoretical computer scientists are always probing the relationship of space (memory) and time. For 50 years, experts knew that a calculation of X steps required X/log X memory slots, but a new ...

Will algorithms designed for interconnected computers hold up if some of the machines are not here on Earth but flying about in space, onboard satellites or spacecraft?