Algorithms

Artificial intelligence software is designing novel experimental protocols that improve upon the work of human physicists, although the humans are still “doing a lot of baby-sitting.”

The catch: It would require the energy of a few medium-size stars.

One computer scientist’s “stunning” proof is the first progress in 50 years on one of the most famous questions in computer science.

Researchers have devised a scheme for painting the edges of a graph that’s almost as speedy as possible.

Despite the hype, it’s been surprisingly challenging to find quantum algorithms that outperform classical ones. In this episode, Ewin Tang discusses her pioneering work in “dequantizing” quantum algorithms — and what it means for the future of quantum computing.

A simple, widely used mathematical technique can finally be applied to boundlessly complex problems.

It’s been difficult to find important questions that quantum computers can answer faster than classical machines, but a new algorithm appears to do it for some critical optimization tasks.

Ten years ago, researchers proved that adding full memory can theoretically aid computation. They’re just now beginning to understand the implications.

A young computer scientist and two colleagues show that searches within data structures called hash tables can be much faster than previously deemed possible.