What's up in
Which Computational Universe Do We Live In?
Cryptographers want to know which of five possible worlds we inhabit, which will reveal whether truly secure cryptography is even possible.
Researchers Identify ‘Master Problem’ Underlying All Cryptography
The existence of secure cryptography depends on one of the oldest questions in computational complexity.
Computer Scientists Eliminate Pesky Quantum Computations
For years, intermediate measurements made it hard to quantify the complexity of quantum algorithms. New work establishes that those measurements aren’t necessary after all.
Surprising Limits Discovered in Quest for Optimal Solutions
Algorithms that zero in on solutions to optimization problems are the beating heart of machine reasoning. New results reveal surprising limits.
Computer Scientists Discover Limits of Major Research Algorithm
The most widely used technique for finding the largest or smallest values of a math function turns out to be a fundamentally difficult computational problem.
What Makes Quantum Computing So Hard to Explain?
To understand what quantum computers can do — and what they can’t — avoid falling for overly simple explanations.
Matrix Multiplication Inches Closer to Mythic Goal
A recent paper set the fastest record for multiplying two matrices. But it also marks the end of the line for a method researchers have relied on for decades to make improvements.
Pioneers Linking Math and Computer Science Win the Abel Prize
Avi Wigderson and László Lovász won for their work developing complexity theory and graph theory, respectively, and for connecting the two fields.
New Algorithm Breaks Speed Limit for Solving Linear Equations
By harnessing randomness, a new algorithm achieves a fundamentally novel — and faster — way of performing one of the most basic computations in math and computer science.