nphard 
Although this problem is NPHard, one may obtain a solution that is within a proven bound of the optimal.


Complexity theory indicates that most resourceconstrained project scheduling problems are NPhard.


Estimating Treewidth Finding the treewidth of an arbitrary graph is known to be NPhard.


However, we believe that finding the optimal set is NPhard.


Hence, the correspondence to combinatorial auctions suggests that the problem of finding an allocation with maximal social welfare is at least NPhard.


Implied by this observation is that identifying superfluous clauses is an NPhard problem.


Learning a graphical model is an NPhard problem and in this paper, various heuristics have been proposed to speed up the learning process.


Moreover, nested inside each of our problems are NPhard second stage decision problems.


Moreover, we do not know whether the transceiver minimization problem is NPhard.


NPhard optimization problems can be solved consistently within a reasonable amount of time only if instance size is sufficiently small.


Recall that finding an integral solution with minimum potential is NPhard.


Surprisingly, finding a mostpreferred model in even this very limited system is shown to be NPhard.


The CVP problem is a difficult problem, NPhard even when allowing quite large approximation factors.


The first is NPcomplete and the second is conjectured NPhard.


Unfortunately, as with the classical location problem, the problem is NPhard.


We show that constructing an optimal rectangular layout is NPhard.


We have proven that false alarms can be corrected in polynomial time, but the correction of missing alarms is NPhard.

