Say we find an algorithm which solves NP-Complete problems in polynomial time but we can’t prove it. What would the consequences be?
SupportExpert
Say we find an algorithm which solves NP-Complete problems in polynomial time but we can’t prove it. What would the consequences be?
Share