Suppose it is proven that P != NP.
Which of the following would then be a consequence?

Question

Suppose it is proven that P != NP. 
 Which of the following would then be a consequence?

Accepted Answer

No polynomial-time algorithm exists for the knapsack problem.

Answer

No polynomial-time algorithm exists for integer factorization.

Answer

There is a polynomial-time algorithm for the bin packing problem.

Answer

Don't know

Answer

RSA encryption cannot be feasibly broken.

Crowdly