Subj : Re: stacking algorithm
To   : comp.programming
From : googmeister
Date : Sun Aug 07 2005 05:09 am


Omri Barel wrote:
> And now we've reduced the problem to finding a minimum clique partition
> of the graph, which is an NP problem:

Of course, reducing a problem to an NP-complete problem does not
imply the original problem is hard. If you want to establish
intractability,
the reduction needs to go in the other direction.

.