New research from the University of Waterloo is making inroads on one of the biggest problems in theoretical computer science ...

A solution to P vs NP could unlock countless computational problems—or keep them forever out of reach. 1. On Monday, July 19, 2021, in the middle of another strange pandemic summer, a leading computer ...

The prolific researcher found deep connections between randomness and computation and spent a career influencing cryptographers, complexity researchers and more. For more than 40 years, Avi Wigderson ...

The original version of this story appeared in Quanta Magazine. They say a bird in the hand is worth two in the bush, but for computer scientists, two birds in a hole are better still. That’s because ...

Pose a question to a Magic 8 Ball, and it’ll answer yes, no or something annoyingly indecisive. We think of it as a kid’s toy, but theoretical computer scientists employ a similar tool. They often ...