Say we find an algorithm which solves NP-Complete problems in polynomial time but we ca n't prove it . What would the consequences be ?
If I solve any NP problem can I then apply that to solve all other NP problems ? Does using heuristics count as solving the problem ?