Algorithmic complexity and information theory are foundational disciplines that intersect to elucidate how data is structured, transmitted and computed. At its core, algorithmic complexity seeks to ...

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

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

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

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

Back in the hazy olden days of the pre-2000s, navigating between two locations generally required someone to whip out a paper map and painstakingly figure out the most optimal route between those ...

To help curb the spread of covid-19 by exercising "social distancing", we will be cancelling our regular theory seminars immediately until further notice. A half-space (over the Boolean hypercube) is ...

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