Recognizing Shrinkable Complexes Is NP-Complete

In these three problems we ask whether it is possible to choose the right order in which the intersection of several automata must be performed in order to minimize the number

Hagstr¨om et al. [6] all distinguish between positive authorizations that only grant access and positive authorizations that additionally grant delegation rights. In a delegation

L’identification de Streptococcus agalactiae dans les prélèvements vaginaux nous a permis de mesurer la prévalence de portage chez les femmes enceintes, et de faire

Centre de recherche INRIA Paris – Rocquencourt : Domaine de Voluceau - Rocquencourt - BP 105 - 78153 Le Chesnay Cedex Centre de recherche INRIA Rennes – Bretagne Atlantique :

L’archive ouverte pluridisciplinaire HAL, est destinée au dépôt et à la diffusion de documents scientifiques de niveau recherche, publiés ou non, émanant des

Unit´e de recherche INRIA Rennes, Irisa, Campus universitaire de Beaulieu, 35042 RENNES Cedex Unit´e de recherche INRIA Rh ˆone-Alpes, 46 avenue F´elix Viallet, 38031 GRENOBLE Cedex

As a first result towards the 1-2-3 Conjecture, Karo´ nski, Luczak and Thomason proved that there is a set W of 183 real weights such that any graph with no isolated edge admits

For instance the constraint G CC , which channels the number of occurrences of values in a set of variables X to another set of variables Y is NP-complete for discrete domains