We give a polynomial time algorithm that computes a decomposition of a finite group G given in the form of its multiplication table. That is, given G, the algorithm outputs two su...
Valiant’s theory of holographic algorithms is a novel methodology to achieve exponential speedups in computation. A fundamental parameter in holographic algorithms is the dimens...
Abstract. Turing machines exposed to a small stochastic noise are considered. An exact characterisation of their (≈ Π0 2 ) computational power (as noise level tends to 0) is obt...
We present a computational framework designed to provide adaptive support aimed at triggering learning from problem-solving activities in the presence of worked-out examples. The k...
Access control is central to security in computer systems. Over the years, there have been many efforts to explain and to improve access control, sometimes with logical ideas and ...