Transient simulation of a gate circuit is an efficient method of counting signal changes occurring during a transition of the circuit. It is known that this simulation covers the ...
In [13], Erd˝os et al. defined the local chromatic number of a graph as the minimum number of colors that must appear within distance 1 of a vertex. For any ∆ ≥ 2, there are ...
We exploit the recently proposed Concept Abduction inference service in Description Logics to solve Concept Covering problems. We propose a framework and polynomial greedy algorit...
Tommaso Di Noia, Eugenio Di Sciascio, Francesco M....
We study Vector Addition Systems with States (VASS) extended in such a way that one of the manipulated integer variables can be tested to zero. For this class of system, it has bee...
We describe a framework for expressing the complexity of algorithms for FPT problems with two separate parameters k, m and with exponential time bounds O∗ (xk ym ) where x, y &g...