The biggest risk is not taking any risk.
Every problem in NP can be reduced to the satisfiability problem, which is the cornerstone of computational complexity theory.