Sentence examples for maps is NP-hard from inspiring English sources

Shimony has shown that finding MAPs is NP-hard.

Tzitzikas et al. [6] showed that the problem of finding the optimal mapping is NP-hard in the general case and polynomial in the case where bnodes are not directly connected.

Finding the optimal mapping, however, is NP-hard in the worst case.

Goldman et al. [ 24] showed that the contact map problem is NP-hard.

If this prohibition holds, the problem of building the globally minimal (i.e., globally minimizing the cost functional) mapping of G into S is NP-hard.

DAG Partitioning is NP-hard.

The problem is NP-hard.

Unfortunately, it is NP-hard.

Solving the developed model is NP-hard.

The considered problem is NP-hard.

J-MIN-Seed, unfortunately, is NP-hard.