Complexity theory is a fundamental branch of theoretical computer science that categorises computational problems according to their inherent difficulty and the resources required to solve them. At ...

A new theory could bring a way to make quantum algorithm development less of an accidental process, say scientists. In 2019, Google claimed it was the first to demonstrate a quantum computer ...

Welcome to the website of the CS theory group at CU Boulder! Our faculty and students research all aspects of theoretical computer science, from core areas such as algorithms, complexity, and ...

Part of “Complexity Theory,” a column on the tangled questions of our technological age. “Addressing algorithmic bias is like hygiene,” she told me. “You don’t brush once, you don’t floss once, you do ...

The mathematics of symmetry, also known as group theory, is widely used as a tool in the solution of complex problems in many areas of theoretical physics, including string theory. A sequence of ...

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 major advance reveals deep connections between the classes of problems that computers can — and can’t — possibly do. At first glance, the big news coming out of this summer’s conference on the ...

WEST LAFAYETTE, Ind. — In 2019, Google claimed it was the first to demonstrate a quantum computer performing a calculation beyond the abilities of today’s most powerful supercomputers. But most of the ...