NP-hard

Let $${\pi _A}$$ be a problem that belongs to the class NP. Then which one of the following is TRUE?

The subset-sum problem is defined as follows: Given a set S of n positive integers and a positive integer W, determine whether there is a subset of S Whose elements sum to W. An al...

Let S be an NP-complete problem and Q and R be two other problems not known to be in NP. Q is polynomial time reducible to S and S is polynomial-time reducible to R. Which one of t...

Let SHAM 3 be the problem of finding a Hamiltonian cycle in a graph G = (V, E) with |V| divisible by 3 and DHAM 3 be the problem of determining if a Hamiltonian cycle exists in suc...

Which of the following problems is not NP-hard?