Report copyright - P, NP Problems · A problem is NP-hard if it is as hard as any problem in NP. (The existence of a polynomial-time algorithm for an NP-hard problem implies the existence of polynomial
Please pass captcha verification before submit form