The Vertex Cover Problem on Cubic Bridgeless Graphs is NP-complete and also in P | Hacker News Reader