What's up in
AI Reveals New Possibilities in Matrix Multiplication
Inspired by the results of a game-playing neural network, mathematicians have been making unexpected advances on an age-old math problem.
Computer Scientists Prove That Certain Problems Are Truly Hard
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.
Researchers Identify ‘Master Problem’ Underlying All Cryptography
The existence of secure cryptography depends on one of the oldest questions in computational complexity.
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.