If P=NP there might still be no practical implications - if there is a minimum complexity bound on the order of the polynomial, then it might remain completely

If P=NP there might still be no practical implications - if there is a minimum complexity bound on the order of the polynomial, then it might remain completely impractical to solve np complete problems.