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

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

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

Primal methods constitute a common approach to solving (combinatorial) optimization problems. Starting from a given feasible solution, they successively produce new feasible solutions with ...

Complexity theory remains one of the great unsolved mathematical puzzles. Kenneth Regan is trying to figure it out. Kenneth Regan paused at lunch in New York to glance at incoming texts from top ...

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