Say that we are given a decision instance of the vertex cover and k is the input parameter. If we applay a a naive ftp algorithm: we try all possibilities subsets of size k. i.e. (n choose k), we can solve this problem in polynomial time to n. Why does this not prove p = np?
