We study the graph partitioning problem on ddimensional ball graphs in a geometric way. Let B be a set of balls in d-dimensional Euclidean space with radius ratio and -precision....
Abstract. In this paper we study dualities of graphs and, more generally, relational structures with respect to full homomorphisms, that is, mappings that are both edge- and non-ed...
The principle sPHPa b (PV (α)) states that no oracle circuit can compute a surjection of a onto b. We show that sPHP (a) P (a)(PV (α)) is independent of PV1(α)+sPHP π(a) Π(a)...
One of the best ways of studying ordered algebraic structures is through their spectra. The three well-known spectra usually considered are the Brumfiel, Keimel, and the maximal sp...
Following a brief discussion of uniprocessor scheduling in which we argue the case for formal analysis, we describe a distributed Event B model of interrupt driven scheduling. We ï...