We present conditions under which graph transformation rules can be applied in time independent of the size of the input graph: graphs must contain a unique root label, nodes in the left-hand sides of rules must be reachable from the root, and nodes must have a bounded outdegree. We establish a constant upper bound for the time needed to construct all graphs resulting from an application of a f...

While the relationship of time and space is an established topic in traditional centralised complexity theory, this is not the case in distributed computing. We aim to remedy this by studying the time and space complexity of algorithms in a weak message-passing model of distributed computing. While a constant number of communication rounds implies a constant number of states visited during the ...

The gap parameter for color superconductivity is expected to be a gauge invariant quantity, at least on the appropriate mass shell. Computing the gap to subleading order in the QCD coupling constant, g, we show that the prefactor of the exponential in 1/g is gauge dependent off the mass shell, and independent of gauge on the mass shell.