Answer by Raphael for Meaning of complexity of a computational problem
You are missing one thing, namely that the optimal algorithm and worst instance are not simply functions of the instance size. Also, I am not sure that minimising/maximising algorithm and instance...
View ArticleMeaning of complexity of a computational problem
If I understand correctly, the complexity of solving a computational problem is defined in terms of which instance $I$ of the problem, what size $n$ of the problem instance, and what algorithm $A$ for...
View Article
More Pages to Explore .....