We study line systems in metric spaces induced by graphs. A line is a subset of vertices defined by a relation of betweeness. We show that the class of all graphs having exactly k ...
Recent studies have provided many characterisations of the class of polynomial time computable functions through term rewriting techniques. In this paper we describe a (fully autom...
We present two results for computational models that allow error probabilities close to 1/2. First, most computational complexity classes have an analogous class in communication ...
Abstract. In this paper we construct fixed finite tile systems that assemble into particular classes of shapes. Moreover, given an arbitrary n, we show how to calculate the tile co...
—In this paper, we classify multitolerant systems, i.e., systems that tolerate multiple classes of faults and provide potentially different levels of tolerance to them in terms o...