http://bindingmachinesguide.com – Question by osiris_2kk: What are the steps required in proving a problem is NP-complete? and what would be the implications if a Turing machine solving an NP-complete problem was found to have an exponential upper bound or an exponential lower bound? Best answer: Answer by TheMathemagicianA problem is said to be NP-complete if (1) The problem is in NP (2) Every problem in NP can be reduced to the problem in polynomial time. Most of the time, a problem is proved to be NP-complete by showing that it i (General)