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 ...

A UB COMPUTER scientist, Jin-Yi Cai, and a computer science graduate student, D. Sivakumar, have proven one of the oldest conjectures in the field of complexity theory. They did it using a combination ...

New research from the University of Waterloo is making inroads on one of the biggest problems in theoretical computer science. But the way to do it, according to Cameron Seth, a Ph.D. researcher ...

One July afternoon in 2024, Ryan Williams set out to prove himself wrong. Two months had passed since he’d hit upon a startling discovery about the relationship between time and memory in computing.

A leader in the field of computational theory is the latest winner of the A. M. Turing Award, sometimes described as the ‘Nobel Prize’ of computer science. Avi Wigderson at the Institute for Advanced ...

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. Many aspects of modern applied research ...

When the Clay Mathematics Institute put individual $1-million prize bounties on seven unsolved mathematical problems, they may have undervalued one entry—by a lot. If mathematicians were to resolve, ...

Ashutosh Trivedi is an Associate Professor of computer science at the University of Colorado Boulder. His researchinterests lie at the intersection of computer science, control theory, and machine ...