Displaying and navigating complex information on wearable computers is very different from accessing the same information while sitting at your desk. Limitations in hardware, scre...
We completely characterise the computational complexity of the list homomorphism problem for graphs in combinatorial and algebraic terms: for every graph H the problem is either N...
Abstract. In this paper, we revisit the consensus of computational complexity on exact inference in Bayesian networks. We point out that even in singly connected Bayesian networks,...