Henry Yuen is developing a new mathematical language to describe problems whose inputs and outputs aren’t ordinary numbers.

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

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

Computer science graduate students from around the world are brought together at UW to learn in an exciting atmosphere. Students are encouraged to bring their curiosity and sense of discovery to each ...

From powering search engines to securing data and optimizing networks, algorithms underpin nearly every aspect of modern technology. Understanding how efficiently they can solve problems — and where ...