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

Nobel laureate economist Richard Thaler famously quipped: People aren’t dumb, the world is hard. Indeed, we routinely encounter problems in our everyday lives that feel complex – from choosing the ...

A striking new proof in quantum computational complexity might best be understood with a playful thought experiment. Run a bath, then dump a bunch of floating bar magnets into the water. Each magnet ...

Avi Wigderson and László Lovász won for their work developing complexity theory and graph theory, respectively, and for connecting the two fields. When Avi Wigderson and László Lovász began their ...

Studying the epic journey of the iconic jumping plumber can lead to new insights in theoretical computer science—and may help ...

A Toronto researcher who has dedicated his career to proving whether certain types of problems are solvable by computers has won this year's Gerhard Herzberg Canada Gold Medal for Science and ...

Overview: Algorithm selection is an engineering decision: the wrong choice can freeze a system at scale, regardless of ...

Computing is part of everything we do. Computing drives innovation in engineering, business, entertainment, education, and the sciences—and it provides solutions to complex, challenging problems of ...