Counting Constraint Satisfaction Problems (commonly referred to as #CSP) form a foundational framework in computational complexity theory by addressing the challenge of enumerating all possible ...

This graduate course is an introduction to computational complexity. Computational complexity studies the limits and capabilities of efficient computation, as well as tradeoffs between different ...

Kolmogorov complexity uses computer science to measure the amount of information (or randomness) contained in finite objects. In addition to being interesting philosophically, Kolmogorov complexity ...