Hello @DanielFischer
I have to determine if the proposition "Polynomial: good, exponential: bad" is right and justify my answer.
Could I say the following?
Suppose that we have input of size n and we want to run an algorithm to get an information about the input.
Since $O(n^a) \subset O(b^m), a,b,m,n \in \mathbb{N}$, the exponential algorithm will require more time to terminate, and so the proposition is right.