We present algebraic conditions on constraint languages Γ that ensure the hardness of the constraint satisfaction problem CSP(Γ) for complexity classes L, NL, P, NP and ModpL. Th...
In the last few years, multicasting is increasingly used as an efficient communication mechanism for group-oriented applications in the Internet. Some multicast applications requi...
Said Gharout, Yacine Challal, Abdelmadjid Bouabdal...
The classical and well-studied group testing problem is to find d defectives in a set of n elements by group tests, which tell us for any chosen subset whether it contains defectiv...
A `2-group' is a category equipped with a multiplication satisfying laws like those of a group. Just as groups have representations on vector spaces, 2-groups have representa...
In this paper we produce complexity and impossibility results and develop algorithms for a task allocation problem that needs to be solved by a group of autonomous agents working ...