Computational complexity

Researchers have proved that secure quantum encryption is possible in a world without hard problems.

Researchers have shown how to find the simplest description of a data set faster than by simply checking every possibility.

The prolific researcher found deep connections between randomness and computation and spent a career influencing cryptographers, complexity researchers and more.

Russell Impagliazzo studies hard problems, the limits of cryptography, the nature of randomness and more.

Large language models do better at solving problems when they show their work. Researchers are beginning to understand why.

Researchers have shown that a problem relating to the energy of a quantum system is easy for quantum computers but hard for classical ones.

Integer linear programming can help find the answer to a variety of real-world problems. Now researchers have found a much faster way to do it.

Locally correctable codes need barely any information to fix errors, but they’re extremely long. Now we know that the simplest versions can’t get any shorter.

Artificial intelligence learned how to generate text and art better than ever before, while computer scientists developed algorithms that solved long-standing problems.