And vise versa, a proof that P!=NP do not exclude an algorithm that is fast enough for practical n.