Hi Fellow EE Experts
Looking for a quick proof here on the following. one showing it can be done and an example showing it cant.
Looking at the following NP Problem.
http://en.wikipedia.org/wiki/Clique_problem
How would I show that for one instance an example can be solved in a finite amount of time and the other an exponential?
Any Help would be grealty appreciated.
Many Thanks
Steve