“Imagine a computation that produces a new bit of information in every step, based on the bits that it has computed so far. Over t steps of time, it may generate up to t new bits of information in ...

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

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

Graphs are everywhere. In discrete mathematics, they are structures that show the connections between points, much like a public transportation network. Mathematicians have long sought to develop ...

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

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

Recent survey delivers the first systematic benchmark of TSP solvers spanning end-to-end deep learners, hybrid methods and ...