algorithms

The universe of problems that a computer can check has grown. The researchers’ secret ingredient? Quantum entanglement.

Quantum computers can’t selectively forget information. A new algorithm for multiplication shows a way around that problem.

By chopping up large numbers into smaller ones, researchers have rewritten a fundamental mathematical speed limit.

Researchers have just released hacker-proof cryptographic code — programs with the same level of invincibility as a mathematical proof.

Some researchers are using a complexity framework thought to be purely theoretical to understand evolutionary dynamics in biological and computational systems.

Computer vision researchers have uncovered a world of visual signals hiding in our midst, including subtle motions that betray what’s being said and faint images of what’s around a corner.

The nearest neighbor problem asks where a new point fits into an existing data set. A few researchers set out to prove that there was no universal way to solve it. Instead, they found such a way.

The theoretical computer scientist Constantinos Daskalakis has won the Rolf Nevanlinna Prize for explicating core questions in game theory and machine learning.

Computer scientists have been searching for years for a type of problem that a quantum computer can solve but that any possible future classical computer cannot. Now they’ve found one.