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

A new theory could bring a way to make quantum algorithm development less of an accidental process, say scientists.

Computer Scientists Discover Limits of Major Research Algorithm The most widely used technique for finding the largest or smallest values of a math function turns out to be a fundamentally difficult ...

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 couple of decades ago, Steve Cook moved on to other related problems in complexity theory. With one problem, he made a conjecture about the amount of memory an algorithm would need to solve the ...

Quantum Computation and Quantum Information by Nielsen and Chuang is the foundational text, covering algorithms, cryptography, and computational complexity. Qua ...

Complexity theory remains one of the great unsolved mathematical puzzles. Kenneth Regan is trying to figure it out.

Since the 1970s, algorithms have been able to test graph isomorphism, but in exponential time. This means that the increasing complexity of the graphs increased the algorithm's running time ...