Question: are np complete problems solvable?
Answer: The complexity class of problems of this form is called NP, an abbreviation for "nondeterministic polynomial time". ... The set of NP-complete problems is often denoted by NP-C or NPC. Although a solution to an NP-complete problem can be verified "quickly", there is no known way to find a solution quickly.