We care about your data, and we'd like to use cookies to give you a smooth browsing experience. Please agree and read more about our privacy policy.

Why verify every line of a proof, when just a few checks will do?

Finding out whether a question is too difficult to ever solve efficiently depends on figuring out just how hard it is. Researchers have now shown how to do that for a major class of problems.

Language processing programs are notoriously hard to interpret, but smaller versions can provide important insights into how they work.

For the first time, experiments demonstrate the possibility of sharing secrets with perfect privacy — even when the devices used to share them cannot be trusted.

Two researchers show that for neural networks to be able to remember better, they need far more parameters than previously thought.

A new result shows that quantum information can theoretically be protected from errors just as well as classical information can.

By carefully constructing a multidimensional and well-connected graph, a team of researchers has finally created a long-sought locally testable code that can immediately betray whether it’s been corrupted.

After decades of effort, mathematicians now have a complete understanding of the complicated equations that model the motion of free boundaries, like the one between ice and water.

A new proof establishes the boundary at which a shape becomes so corrugated, it can be crushed.