32 search results - page 2 / 7 » Crozzle: an NP-complete problem |
PPL
2007
13 years 5 months ago
2007
In this work we are interested in the problem of scheduling and redistributing data on master-slave platforms. We consider the case were the workers possess initial loads, some of...
RECOMB
2010
Springer
13 years 4 months ago
2010
Springer
In comparative genomics, various combinatorial models can be used to specify gene clusters — groups of genes that are co-located in a set of genomes. Several approaches have been...
JGT
2010
13 years 12 days ago
2010
We answer two open questions posed by Cameron and Nesetril concerning homomorphismhomogeneous graphs. In particular we show, by giving a characterization of these graphs, that ext...
CORR
2008
Springer
13 years 5 months ago
2008
Springer
In connection with machine arithmetic, we are interested in systems of constraints of the form x + k y + k . Over integers, the satisfiability problem for such systems is polynomi...
AAAI
2008
13 years 8 months ago
2008
The study of random instances of NP complete and coNP complete problems has had much impact on our understanding of the nature of hard problems. In this work, we initiate an effor...