The usual idea of compactness of a space is that if the space has an open cover then it has a finite subcover which is not very intuitive. In this talk we attempt to look at some equivalent characterisations of compact spaces.

I will present a technique know as fast subset convolution for Exact Exponential Algorithms.

Nowadays SAT solvers are able to solve problems with millions of variables, but some instances are still hard. While some formulas just require large time or memory to solve, other formulas allow to trade these resources.

Caching of popular content during off-peak hours is a strategy to reduce the network load during peak hours. We consider a model where multiple caches store pre-fetched content and when users request files, they are matched to caches based on the

Consider a system consisting of a binary "stimulus" variable X, (e.g. whether an individual consumes tobacco), a binary "response" variable Y, (e.g.