Prove: P=NP implies every NP problem solves in polynomial time
Analyze the prove: p=np implies every np problem solves in polynomial time.
Examples
Input:"test_input_1"
Output:"output_1"
Input:"test_input_2"
Output:"output_2"
Hints
Recall the definition of NP-completeness: A problem is NP-complete if it is in NP and every problem in NP reduces to it in polynomial time.
Consider the implications of a polynomial-time algorithm for an NP-complete problem: How would it affect the entire class of NP problems?
Think about the Cook-Levin theorem, which establishes that the Boolean satisfiability problem (SAT) is NP-complete. How does solving SAT in polynomial time impact the P vs NP question?
Prove: P=NP implies every NP problem solves in polynomial time
Analyze the prove: p=np implies every np problem solves in polynomial time.