# 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?

Chapter 17, Reinforcement #12

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?

## This problem has been solved!

Do you need an answer to a question different from the above? Ask your question!

**Related Book For**

## Algorithm Design And Applications

1st Edition

**Authors:** Michael T. Goodrich, Roberto Tamassia

**ISBN:** 9781118335918