Professor Amongus has just designed an algorithm that can take any graph G with n vertices and

Question:

Professor Amongus has just designed an algorithm that can take any graph G with n vertices and determine in O(n^k) time whether G contains a clique of size k. Does Professor Amongus deserve the Turing Award for having just shown that P = NP? Why or why not?

Fantastic news! We've Found the answer you've been seeking!