Yes. The Vertex Cover Problem is NP-complete. If a polynomial-time algorithm exists for any NP-complete problem, then P = NP.